Combinatorial optimization
The course is not on the list Without time-table
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
128YKOP | ZK | 3 | 2P | Czech |
- Course guarantor:
- Lecturer:
- Tutor:
- 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:
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans: