Problems and Algorithms

The course cannot be taken simultaneously with:

Problems and Algorithms (E36PAA)

Lecturer:

Tutor:

Supervisor:

Department of Computer Science and Engineering

Synopsis:

Combinatorial problems: overview and solving methods, complexity analysis

of algorithms, state space and searching, deterministic model of

computation, classes P and NP, NP-complete and NP-hard problems, polynomial

reduction, evaluation of heuristic methods, local methods, iterative

methods, simulated annealing, simulated evolution, global methods, linear

programming, integer-programming, dynamic programming.

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: