Theory of linear and integer programming
Theory of linear and integer programming
Chva´tal closures for mixed integer programming problems
Mathematical Programming: Series A and B
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Split closure and intersection cuts
Mathematical Programming: Series A and B
MIR closures of polyhedral sets
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
Lifting for conic mixed-integer programming
Mathematical Programming: Series A and B
A constructive characterization of the split closure of a mixed integer linear program
Operations Research Letters
On some generalizations of the split closure
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Facial structure and representation of integer hulls of convex sets
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Communication: On families of quadratic surfaces having fixed intersections with two hyperplanes
Discrete Applied Mathematics
| Hi-index | 0.00 |
The Chvatal-Gomory closure and the split closure of a rational polyhedron are rational polyhedra. It has been recently shown that the Chvatal-Gomory closure of a strictly convex body is also a rational polytope. In this note, we show that the split closure of a strictly convex body is defined by a finite number of split disjunctions, but is not necessarily polyhedral. We also give a closed form expression in the original variable space of a split cut for full-dimensional ellipsoids.