@inproceedings{0975dbcb1cf24349a3e9d703e295d451,

title = "On some generalizations of the split closure",

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.",

keywords = "Cross cuts, closure, polyhedrality",

author = "Sanjeeb Dash and Oktay G{\"u}nl{\"u}k and Ramirez, {Diego Alejandro Mor{\'a}n}",

year = "2013",

doi = "10.1007/978-3-642-36694-9_13",

language = "English",

isbn = "9783642366932",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "145--156",

booktitle = "Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Proceedings",

note = "null ; Conference date: 18-03-2013 Through 20-03-2013",

}