Integer Programming
The tutorial is scheduled on Thursday at 10:40 in S221 (corridor on the 2nd floor). 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: 16. 3.]
- Theory: Integer polyhedra, unimodularity, complexity
- Methods for solving integer programs
- Heuristics, decompositions and software
- Special cases: Knapsack, TSP and others
Points
✔ = at least 50%, ✘ = less than 50%
| Nickname | S1 | S2 | S3 | S4 | S5 | Σ |
|---|
| Maximalist student | 20 | 20 | 20 | 20 | 20 | 100 |
Schedule of the Tutorials
02.03.2023
Formulating integer linear programs.
16.03.2023
Integer polyhedra. (Totally) unimodular matrices. Complexity of integer programming.
06.04.2023
Methods for solving integer programs: Cutting planes and Branch-and-bound.
20.04.2023
Heuristics, decompositions and column generation methods. Software for solving integer programs.
04.05.2023
Special cases of integer programs: Knapsack, TSP and others.
18.05.2023
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: