The tutorial is scheduled on Tuesday at 10:40 in S321 (corridor on the 3rd floor). If you have any questions, you can reach me via e-mail at elif@kam.mff.cuni.cz.
✔ = at least 50%, ✘ = less than 50%
| Nickname | S1 | S2 | S3 | S4 | S5 | Σ |
|---|---|---|---|---|---|---|
| Maximalist student | 10 | 10 | 10 | 10 | 10 | 50 |
Lagrange decomposition. Set covering and the greedy algorithm.
Column generation. Benders decomposition. Facility location problem and its properties.
Knapsack problem. Traveling salesman problem.
Solutions of homework set 3. Modeling languages and solvers.
Preprocessing and heuristics. Knapsack problem.
Chvátal-Gomory cuts. Branch and bound methods.
Solutions of homework sets 1 & 2.
Gomory cuts for pure and mixed integer linear programs.
Complexity. Lexicographic method and the first Gomory algorithm.
No tutorial!
Comparing formulations. Unimodularity and total unimodularity.
The art of formulating integer programs.