Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets

Amitabh Basu, Robert Hildebrand, Matthias Köppe

We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced…