Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation
In cutting plane-based methods, the question of how to generate the “best possible” cuts is a central and critical issue. We propose a bi-criteria separation problem for generating valid inequalities that simultaneously maximizes the cut violation and a measure of the diversity between the new cut and the previously generated cut(s). We focus on problems with cuts having 0-1 coefficients, and use the 1-norm as diversity measure. In this context, the bi-criteria separation amounts to solving the standard single-criterion separation problem (maximizing violation) with different coefficients in the objective function. We assess the impact of this general approach on two challenging combinatorial optimization problems, namely the Min Steiner Tree problem and the Max Clique problem. Computational experiments show that the cuts generated by the bi-criteria separation are much stronger than those obtained by just maximizing the cut violation, and allow to close a larger fraction of the gap in a smaller amount of time.
Unable to display preview. Download preview PDF.
- 1.Achterberg, T.: Constrained Integer Programming. PhD thesis, Technische Universitat at Berlin (2007)Google Scholar
- 5.Balas, E., Fischetti, M., Zanette, A.: Can pure cutting plane algorithms work? In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 416–434. Springer, Heidelberg (2008)Google Scholar
- 7.Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability. In: Second DIMACS Implementation Challenge. DIMACS Series in Disc. Math. and Theo. Comp. Scie. Amer. Math. Soc., vol. 26 (1996)Google Scholar
- 9.Koch, T., Martin, A., Voß, S.: SteinLib: An updated library on steiner tree problems in graphs. Technical Report ZIB-Report 00-37, ZIB Berlin, Takustr. 7, Berlin (2000)Google Scholar