Learning Efficient Search Approximation in Mixed Integer Branch and Bound

07/08/2020
by   Kaan Yilmaz, et al.
0

In line with the growing trend of using machine learning to improve solving of combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer programming branch-and-bound tree by using a learned policy. In contrast to previous work using imitation learning, our policy is focused on learning which of a node's children to select. We present an offline method to learn such a policy in two settings: one that is approximate by committing to pruning of nodes; one that is exact and backtracks from a leaf to use a different strategy. We apply the policy within the popular open-source solver SCIP. Empirical results on four MIP datasets indicate that our node selection policy leads to solutions more quickly than the state-of-the-art in the literature, but not as quickly as the state-of-practice SCIP node selector. While we do not beat the highly-optimised SCIP baseline in terms of solving time on exact solutions, our approximation-based policies have a consistently better optimality gap than all baselines if the accuracy of the predictive model adds value to prediction. Further, the results also indicate that, when a time limit is applied, our approximation method finds better solutions than all baselines in the majority of problems tested.

READ FULL TEXT

page 15

page 17

research
02/12/2020

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies

Branch and Bound (B B) is the exact tree search method typically used ...
research
07/26/2022

Branch Ranking for Efficient Mixed-Integer Programming via Offline Ranking-based Policy Learning

Deriving a good variable selection strategy in branch-and-bound is essen...
research
04/08/2022

DiversiTree: A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems

While most methods for solving mixed-integer optimization problems compu...
research
05/28/2022

Reinforcement Learning for Branch-and-Bound Optimisation using Retrospective Trajectories

Combinatorial optimisation problems framed as mixed integer linear progr...
research
08/11/2022

Learning Computation Bounds for Branch-and-Bound Algorithms to k-plex Extraction

k-plex is a representative definition of communities in networks. While ...
research
10/20/2022

Machine Learning for K-adaptability in Two-stage Robust Optimization

Two-stage robust optimization problems constitute one of the hardest opt...
research
12/14/2022

Cutting Plane Selection with Analytic Centers and Multiregression

Cutting planes are a crucial component of state-of-the-art mixed-integer...

Please sign up or login with your details

Forgot password? Click here to reset