The lecture is scheduled on Tuesday at 14:00 in S4. The tutorial is scheduled on Tuesday at 10:40 in S321 (corridor 3rd floor) and conducted by Elif Garajová.
The lecture starts on February 28, and the tutorial starts on March 7.
28.2. | Classification of integer programs, integer polyhedron and Meyer's theorem. |
7.3. | Unimodular and totally unimodular matrices. Hoffman-Kruskal theorem for integer programs with unimodular matrices. Examples: Incidence matrices of bipartite graphs and directed graphs - transportation problem and network flows. |
14.3. | Complexity of integer programs in detail - NP-completeness. Size of input entries. Boundedness of the integer polyhedron. Related complexity results. |
21.3. | Dual simplex method and ℓ-method for linear programming, lexicographical order. Cutting-plane methods: The first Gomory algorithm for pure integer problem. |
28.3. | Finiteness of the first Gomory algorithm. The second Gomory algorithm for mixed integer problem. A note on Chvátal theorem and Chvátal rank. |
4.4. (plan) | Matej Moravcik and Martin Schmid: Artificial intelligence goes all-in: Computers playing poker, room S5 |
11.4. (plan) | Other cuts. Branch & bound methods. |
18.4. (plan) | Heuristics and column generation. |
25.4. (plan) | Knapsack problem. |
2.5. (plan) | Set covering. |
9.5. (plan) | TSP - Travelling salesman problem. |
16.5. (plan) | Benders decomposition and facility location problem. |
23.5. (plan) | Lagrange decomposition and application in facility location problem and TSP. |