Combinatorial optimization

Lecturer:

Jiří Demel

Tutor:

Jiří Demel

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:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon	roomTH:B-475 Demel J. 12:00–13:50 (lecture parallel1) Thákurova 7 (FSv-budova A) B475
Tue
Fri
Thu
Fri

The course is a part of the following study plans: