A constructive characterization of the split closure of a mixed integer linear program

@article{Vielma2007ACC,
  title={A constructive characterization of the split closure of a mixed integer linear program},
  author={Juan Pablo Vielma},
  journal={Oper. Res. Lett.},
  year={2007},
  volume={35},
  pages={29-35}
}
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. 

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Split closure and intersection cuts

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Cutting planes from a mixed integer Farkas lemma

  • Oper. Res. Lett.
  • 2004
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Disjunctive Programming: Properties of the Convex Hull of Feasible Points

  • Discrete Applied Mathematics
  • 1998
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Integer and Combinatorial Optimization

  • Wiley interscience series in discrete mathematics and optimization
  • 1988

Integer Programming

R. S. Garfinkel, G. L. Nemhauser
  • Wiley, New York
  • 1972
VIEW 1 EXCERPT