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

Maximal Lattice-Free Convex Sets in Linear Subspaces

journal contribution
posted on 01.01.2005, 00:00 by Amitabh Basu, Michele Conforti, 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

01/01/2005

Exports

figshare. credit for all your research.