Abstract
Split cuts form a well-known class of valid inequalities for mixed-integer programming problems (MIP). Cook et al. (1990) showed that the split closure of a rational polyhedron P is again a polyhedron. In this paper, we extend this result from a single rational polyhedron to the union of a finite number of rational polyhedra. We also show how this result can be used to prove that some generalizations of split cuts, namely cross cuts, also yield closures that are rational polyhedra. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Dash, S., Günlük, O., & Ramirez, D. A. M. (2013). On some generalizations of the split closure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7801 LNCS, pp. 145–156). https://doi.org/10.1007/978-3-642-36694-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
