A Machine Learning-Based Approximation of Strong Branching

We present in this paper a new generic approach to variable branching in branch and bound for mixed-integer linear problems. Our approach consists in imitating the decisions taken by a good branching strategy, namely strong branching, with a fast approximation. This approximated function is created by a machine learning technique from a set of observed branching decisions taken by strong branching. The philosophy of the approach is similar to reliability branching. However, our approach can catch more complex aspects of observed previous branchings to take a branching decision. The experiments performed on randomly generated and MIPLIB problems show promising results.

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

[2]  Pierre Geurts,et al.  Extremely randomized trees , 2006, Machine Learning.

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

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

[5]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

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

[7]  Tobias Achterberg,et al.  Mixed Integer Programming: Analyzing 12 Years of Progress , 2013 .

[8]  Kevin Leyton-Brown,et al.  Algorithm runtime prediction: Methods & evaluation , 2012, Artif. Intell..

[9]  Norman J. Driebeek.  An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .

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

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

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

[13]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[14]  Kevin Leyton-Brown,et al.  Automated Configuration of Mixed Integer Programming Solvers , 2010, CPAIOR.

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

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

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

[18]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[19]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[20]  Yuri Malitsky,et al.  DASH: Dynamic Approach for Switching Heuristics , 2013, Eur. J. Oper. Res..