Chva´tal closures for mixed integer programming problems
Mathematical Programming: Series A and B
Disjunctive programming: properties of the convex hull of feasible points
Discrete Applied Mathematics
Split Closure and Intersection Cuts
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Split closure and intersection cuts
Mathematical Programming: Series A and B
Cutting planes from a mixed integer Farkas lemma
Operations Research Letters
On the MIR Closure of Polyhedra
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Split Rank of Triangle and Quadrilateral Inequalities
Mathematics of Operations Research
The chvátal-gomory closure of an ellipsoid is a polyhedron
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Equivalence between intersection cuts and the corner polyhedron
Operations Research Letters
The split closure of a strictly convex body
Operations Research Letters
On some generalizations of the split closure
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
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 Koppe and Weismantel.