A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 )doi:10.1007/978-3-319-59250-3_9 fatcat:idyidjuhyzdgvl4o2coyennluy