Abstract
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). This is obtained by embedding a cut-separation module within a search scheme. The importance of a sound search scheme is well known in the Constraint Programming (CP) community. Unfortunately, the “standard” search scheme typically used for MIP problems, known as the Kelley method, is often quite unsatisfactory because of saturation issues.
In this paper we address the so-called Lift-and-Project closure for 0-1 MIPs associated with all disjunctive cuts generated from a given set of elementary disjunction. We focus on the search scheme embedding the generated cuts. In particular, we analyze a general meta-scheme for cutting plane algorithms, called in-out search, that was recently proposed by Ben-Ameur and Neto [1]. Computational results on test instances from the literature are presented, showing that using a more clever meta-scheme on top of a black-box cut generator may lead to a significant improvement.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Ben-Ameur, W., Neto, J.: Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1), 3–17 (2007)
Cornuéjols, G.: Valid inequalities for mixed integer linear programs. Mathematical Programming 112(1), 3–44 (2008)
Cornuéjols, G., Lemaréchal, C.: A convex analysis perspective on disjunctive cuts. Mathematical Programming 106(3), 567–586 (2006)
Naoum-Sawaya, J., Elhedhli, S.: An interior-point branch-and-cut algorithm for mixed integer programs. Technical report, Department of Management Sciences, University of Waterloo (2009)
Kelley, J.E.: The cutting plane method for solving convex programs. Journal of the SIAM 8, 703–712 (1960)
Elzinga, J., Moore, T.J.: A central cutting plane algorithm for the convex programming problem. Mathematical Programming 8, 134–145 (1975)
Ye, Y.: Interior Point Algorithms: Theory and Analysis. John Wiley, New York (1997)
Tarasov, S., Khachiyan, L., Erlikh, I.: The method of inscribed ellipsoids. Soviet Mathematics Doklady 37, 226–230 (1988)
Bland, R.G., Goldfarb, D., Todd, M.J.: The ellipsoid method: a survey. Operations Research 29(6), 1039–1091 (1981)
Atkinson, D.S., Vaidya, P.M.: A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming 69, 1–43 (1995)
Nesterov, Y.: Cutting plane algorithms from analytic centers: efficiency estimates. Mathematical Programming 69(1), 149–176 (1995)
Goffin, J.L., Vial, J.P.: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Mathematical Programming 60, 81–92 (1993)
Boyd, S., Vandenberghe, L.: Localization and cutting-plane methods (2007), http://www.stanford.edu/class/ee364b/notes/localization_methods_notes.pdf
Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5, 3–51 (1979)
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), http://www.caam.rice.edu/bixby/miplib/miplib.html
Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters 34(4), 1–12 (2006), http://miplib.zib.de
Beasley, J.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischetti, M., Salvagnin, D. (2010). An In-Out Approach to Disjunctive Optimization. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-13520-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13519-4
Online ISBN: 978-3-642-13520-0
eBook Packages: Computer ScienceComputer Science (R0)