Carnegie Mellon University
Browse

Maximal Lattice-Free Convex Sets in Linear Subspaces

Download (285.09 kB)
journal contribution
posted on 2005-01-01, 00:00 authored by Amitabh Basu, Michele Conforti, Gerard CornuejolsGerard 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

2005-01-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC