Cut Generation through Binarization
For a mixed integer linear program where all integer variables are bounded, we study a reformulation introduced by Roy that maps general integer variables to a collection of binary variables. We study theoretical properties and empirical strength of rank-2 simple split cuts of the reformulation. We show that for a pure integer problem with two integer variables, these cuts are sufficient to obtain the integer hull of the problem, but that this does not generalize to problems in higher dimensions. We also give an algorithm to compute an approximation of the rank-2 simple split cut closure. We report empirical results on 22 benchmark instances showing that the bounds obtained compare favorably with those obtained with other approximate methods to compute the split closure or lattice-free cut closure. It gives a better bound than the split closure on 6 instances while it is weaker on 9 instances, for an average gap closed 3.8% smaller than the one for the split closure.
KeywordsSplit cuts closure binarization
Unable to display preview. Download preview PDF.
- 7.Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12–15 (1998)Google Scholar
- 12.Dash, S., Günlük, O., Molinaro, M.: On the relative strength of different generalizations of split cuts. Working paper (2012)Google Scholar
- 13.Dash, S., Günlük, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. Working paper (2011)Google Scholar
- 15.Fischetti, M., Salvagnin, D.: Personnal communicationGoogle Scholar
- 16.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
- 18.Louveaux, Q., Poirrier, L., Salvagnin, D.: The strength of multi-row models. Working paper (2012)Google Scholar
- 20.Roy, J.-S.: “Binarize and Project” to generate cuts for general mixed-integer programs. Algorithmic Oper. Res. 2 (2007)Google Scholar