Minimal Inequalities for an Infinite Relaxation of Integer Programs

We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
• Keywords: Maximal Lattice-free Convex, Maximal S-free Convex, S-free Convex Sets, SIAMDM 2010