Combinatorial Optimization - Lectures

Zdeněk Hanzálek, CTU Prague

1. Introduction of Basic Terms, Example Applications.

2. Integer Linear Programming - Algorithms.

3. Problem Formulation by Integer Linear Programming.

4. Shortest Paths.

5. Problem Formulation by Shortest Paths.

6. Flows and Cuts - Algorithms and Problem Formulation.

7. Bipartite Matching. Multi-commodity Network Flows.

8. Knapsack Problem, Pseudo-polynomial and Approximation Algorithms.

9. Traveling Salesman Problem and Approximation Algorithms.

10. Mono-processor Scheduling.

11. Scheduling on Parallel Processors.

12. Project Scheduling with Temporal Contraints.

13. Constraint Programming.

Youtube viedo přednášek nahraných v letech 2020 a 2021.

Příklady aplikací naleznete na konferenci EURO a na Scheduling Seminar.