We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
On the Rank of Disjunctive Cuts.
- Authors
Pia, Alberto Del
- Abstract
Let L be a family of lattice-free polyhedra Rm containing the splits. Given a polyhedron P in Rm+n, we characterize when a valid inequality for P ∩ (Zm x Rn) can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in L. We also characterize the lattice-free polyhedra M such that all the disjunctive cuts corresponding to M can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in L for every polyhedron P. Our results imply interesting consequences, related to split rank and to integral lattice-free polyhedra, that extend recent research findings.
- Subjects
INTEGER programming; MATHEMATICAL programming; ALGORITHMS; LATTICE theory; POLYHEDRA
- Publication
Mathematics of Operations Research, 2012, Vol 37, Issue 2, p372
- ISSN
0364-765X
- Publication type
Article
- DOI
10.1287/moor.1110.0527