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.

- 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 [deadline: 6. 4.]
- Methods for solving integer programs [deadline: 20. 4.]
- Heuristics, decompositions and software [deadline: 4. 5.,
**extended deadline: 18. 5. for Problem 4.2**] **Special cases: Knapsack, TSP and others [deadline: 18. 5.]**

Formulating integer linear programs.

Integer polyhedra. (Totally) unimodular matrices. Complexity of integer programming.

Methods for solving integer programs: Cutting planes and Branch-and-bound.

Heuristics, decompositions and column generation methods. Software for solving integer programs.

- Exercises and Solutions [in Czech]
- Integer programming software: Gurobi, SCIP (and the ZIMPL language), CPLEX, GLPK, COIN-OR, GAMS, NEOS (online) and other options

Special cases of integer programs: Knapsack, TSP and others.

Review and consultations.

- 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.)

- The Not So Short Introduction to LaTeX (eng, cz)
- LaTeX Wikibook