Cookies?
Library Header Image
LSE Research Online LSE Library Services

Maximal lattice-free convex sets in linear subspaces

Basu, Amitabh and Conforti, Michele and Cornuéjols, Gérard and Zambelli, Giacomo (2010) Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research, 35 (3). pp. 704-720. ISSN 0364-765X

Full text not available from this repository.

Identification Number: 10.1287/moor.1100.0461

Abstract

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.

Item Type: Article
Official URL: http://mor.journal.informs.org/
Additional Information: © 2010 Informs
Subjects: Q Science > QA Mathematics
Sets: Departments > Management
Date Deposited: 21 Jan 2011 12:36
Last Modified: 21 Jan 2011 12:36
URI: http://eprints.lse.ac.uk/id/eprint/31544

Actions (login required)

View Item View Item