Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Combinatorial optimization

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
128YKOP ZK 3 2P Czech
Lecturer:
Jiří Demel (guarantor)
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:
Time-table for winter semester 2019/2020:
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
Tue
Fri
roomTH:B-476

10:00–11:50
(lecture parallel1)
Thákurova 7 (FSv-budova A)
B476
Thu
Fri
Time-table for summer semester 2019/2020:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2020-07-06
For updated information see http://bilakniha.cvut.cz/en/predmet24855805.html