Cutting Planes from Wide Split Disjunctions
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 provide some theory that supports our findings, discuss extensions with respect to cut strengthening procedures and present some ideas on how to use the wider disjunctions also in branching.
KeywordsInteger Variable Wide Split Integrality Requirement Split Disjunction Auxiliary Binary Variable
- 9.Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269–302. McGraw-Hill, New York (1963)Google Scholar
- 12.Pisinger, D.: http://www.diku.dk/pisinger/codes.html. Accessed 19 Feb 2016
- 13.Wiese, S: On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming. Ph.D. thesis, University of Bologna (2016)Google Scholar