Integer Programming
The tutorial is scheduled on Tuesday at 12:20 in room S10. If you have any questions, you can reach me via e-mail at elif@kam.mff.cuni.cz.
Homework
- Credit for the tutorial will be awarded for obtaining at least 50 % of the points in each set of homework problems.
- There will be 5 sets of problems on:
- The art of formulating integer programs [deadline: 11. 3.]
- Theory: Integer polyhedra, unimodularity, complexity
- Methods for solving integer programs
- Heuristics, decompositions and software
- Special cases: Knapsack, TSP and others
Preliminary Schedule of the Tutorials
25. 2. 2025
Formulating integer linear programs.
11. 3. 2025
Integer polyhedra. (Totally) unimodular matrices. Complexity of integer programming.
1. 4. 2025
Methods for solving integer programs: Cutting planes and Branch-and-bound.
15. 4. 2025
Heuristics, decompositions and column generation methods. Software for solving integer programs.
6. 5. 2025
Special cases of integer programs: Knapsack, TSP and others.
20. 5. 2025
Review and consultations.
Resources and Study Materials
- Lecture notes by M. Hladík (in Czech)
- Integer Programming (L. Wolsey)
- Theory of Linear and Integer Programming (A. Schrijver)
- Applied Integer Programming (D. Chen et al.)
- Integer Programming (M. Conforti et al.)
Typesetting mathematical texts: