Maximal Lattice-Free Convex Sets in Linear Subspaces.pdf.pdf' (285.09 kB)

Maximal Lattice-Free Convex Sets in Linear Subspaces

Download (285.09 kB)
journal contribution
posted on 01.01.2005 by Amitabh Basu, Michele Conforti, Gerard Cornuejols, Giacomo Zambelli
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lovász characterizing maximal lattice-free convex sets in Rn

History

Date

01/01/2005

Exports

Exports