| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143226 | Operations Research Letters | 2007 | 7 Pages |
Abstract
Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Juan Pablo Vielma,