• Summary
• Integer linear programming
• A basic result
• Relaxations
• Valid inequalities and the separation problem
• Scheme of a cutting plane algorithm
• The Chvátal inequalities (1973)
• The Gomory cuts
• Mixed 0 - 1 linear programming
• A convexification method
• Properties of the sets Pj(K)
• The external description of the polyhedra P_j(K)
• Separation respect to P_j(K)
• Normalisation criteria
• A cutting plane procedure 1
• A cutting plane procedure 2