| Article ID: | iaor20073116 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 1 |
| Start Page Number: | 29 |
| End Page Number: | 35 |
| Publication Date: | Jan 2007 |
| Journal: | Operations Research Letters |
| Authors: | Vielma Juan Pablo |
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.