Combinatorial algorithms

Lecturer:

Jiří Demel (gar.)

Tutor:

Jiří Demel (gar.)

Supervisor:

Department of Applied Informatics

Synopsis:

Effective algorithms for solving combinatorial optimization problems. Classification of problems and methods, NP-hard problems, advanced polynomial algorithms, branch and bound method, dynamic programming, heuristics, approximation algorithms, approximation schemes, local search, randomized algorithms, genetic algorithms.

Requirements:

none

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Recognition of methods kombinatorické optimalizace.

Study materials:

Kučera, L. Kombinatorické algoritmy.

Papadimitriou, Steiglitz: Combinatorial optimization.

Kozen, D. Design and Analysis of Algorithms, Springer, 1991.

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: