Cloud Branching

Branch-and-bound methods for mixed-integer programming (MIP) are traditionally based on solving a linear programming (LP) relaxation and branching on a variable which takes a fractional value in the (single) computed relaxation optimum. In this paper we study branching strategies for mixed-integer programs that exploit the knowledge of multiple alternative optimal solutions (a cloud) of the current LP relaxation. These strategies naturally extend state-of-the-art methods like strong branching, pseudocost branching, and their hybrids. We show that by exploiting dual degeneracy, and thus multiple alternative optimal solutions, it is possible to enhance traditional methods. We present preliminary computational results, applying the newly proposed strategy to full strong branching, which is known to be the MIP branching rule leading to the fewest number of search nodes. It turns out that cloud branching can reduce the mean running time by up to 30% on standard test sets.

[1]  Gérard Cornuéjols,et al.  Branching on general disjunctions , 2011, Math. Program..

[2]  Andrea Lodi,et al.  Mixed Integer Programming Library version 5 , 2011 .

[3]  David Applegate,et al.  Finding Cuts in the TSP (A preliminary report) , 1995 .

[4]  Martin W. P. Savelsbergh,et al.  Information-based branching schemes for binary linear mixed integer problems , 2009, Math. Program. Comput..

[5]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[6]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[7]  Gerhard J. Woeginger,et al.  Operations Research Letters , 2011 .

[8]  Gerald Gamrath,et al.  Improving strong branching by domain propagation , 2014, EURO J. Comput. Optim..

[9]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[10]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[11]  Matteo Fischetti,et al.  Backdoor Branching , 2011, INFORMS J. Comput..

[12]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[13]  John W. Chinneck,et al.  Active-constraint variable ordering for faster feasibility of mixed integer linear programs , 2007, Math. Program..

[14]  Alberto Caprara,et al.  Global optimization problems and domain reduction strategies , 2010, Math. Program..

[15]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[16]  Matteo Fischetti,et al.  Branching on nonchimerical fractionalities , 2012, Oper. Res. Lett..

[17]  Ignacio E. Grossmann,et al.  A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms , 1999, J. Glob. Optim..

[18]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[19]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[20]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[21]  Timo Berthold,et al.  Hybrid Branching , 2009, CPAIOR.

[22]  Chu Min Li,et al.  Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.

[23]  S.J.J. Smith,et al.  Empirical Methods for Artificial Intelligence , 1995 .

[24]  Gerald Gamrath,et al.  Improving Strong Branching by Propagation , 2013, CPAIOR.

[25]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[26]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..