Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP

by   Warley Almeida Silva, et al.

We present a solver for Mixed Integer Programs (MIP) developed for the MIP competition 2022. Given the 10 minutes bound on the computational time established by the rules of the competition, our method focuses on finding a feasible solution and improves it through a Branch-and-Bound algorithm. Another rule of the competition allows the use of up to 8 threads. Each thread is given a different primal heuristic, which has been tuned by hyper-parameters, to find a feasible solution. In every thread, once a feasible solution is found, we stop and we use a Branch-and-Bound method, embedded with local search heuristics, to ameliorate the incumbent solution. The three variants of the Diving heuristic that we implemented manage to find a feasible solution for 10 instances of the training data set. These heuristics are the best performing among the heuristics that we implemented. Our Branch-and-Bound algorithm is effective on a small portion of the training data set, and it manages to find an incumbent feasible solution for an instance that we could not solve with the Diving heuristics. Overall, our combined methods, when implemented with extensive computational power, can solve 11 of the 19 problems of the training data set within the time limit. Our submission to the MIP competition was awarded the "Outstanding Student Submission" honorable mention.


page 1

page 2

page 3

page 4


Learning Primal Heuristics for Mixed Integer Programs

This paper proposes a novel primal heuristic for Mixed Integer Programs,...

Learning To Dive In Branch And Bound

Primal heuristics are important for solving mixed integer linear program...

Learning to Schedule Heuristics in Branch-and-Bound

Primal heuristics play a crucial role in exact solvers for Mixed Integer...

Confidence Threshold Neural Diving

Finding a better feasible solution in a shorter time is an integral part...

Mini-Bucket Heuristics for Improved Search

The paper is a second in a series of two papers evaluating the power of ...

PUSH: a primal heuristic based on Feasibility PUmp and SHifting

This work describes PUSH, a primal heuristic combining Feasibility Pump ...

Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm

Mixed integer linear programs are commonly solved by Branch and Bound al...

Please sign up or login with your details

Forgot password? Click here to reset