Cutting Planes from Wide Split Disjunctions [chapter]

Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese
2017 Lecture Notes in Computer Science  
In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results. We further discuss extensions of the existing theory with respect to cut strengthening procedures, and present some ideas on how to use the wider disjunctions also in branching. D(y 5,5 )
more » ... {1, 2, 5, 6, 8}. In MILP instead, we would write 1 ≤ y 5,5 ≤ 8, y 5,5 ∈ Z,
doi:10.1007/978-3-319-59250-3_9 fatcat:idyidjuhyzdgvl4o2coyennluy