Problems and Algorithms

Semestr: Summer

Range: 2+2s

Completion:

Credits: 4

Programme type: Undefined

Study form:

Course language:

Summary:

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.

Keywords:

Course syllabus:

Seminar syllabus:

Literature:

Examiners:

Lecturers:

Instructors: