These tutorials shall give an introduction to ILP in polymake. They are primarily aimed at students of the course “Discrete Optimization” at TU Darmstadt and based on demos shown in the lecture.

• ILP and Hilbert bases
• Matching polytopes
• A Counter-example to the integer analogue to Caratheodory's Theorem

The following tutorials were written by students of the course:

• Benjamin's Tutorial