Large Scale Optimization Problems III/III: Improving Linear Programming Approaches

For problems that can be formulated as Integer Linear Programs (ILP), generating strong constraints is necessary for many algorithmic
approaches for these problems. We will present a technique that uses the observation that small NP-hard ILP can be solved very fast. It has
been successfully implemented in program packages for solving TSP and Steiner tree problems.