3 papers
math.OC2022
A machine learning framework for neighbor generation in metaheuristic search
Defeng Liu, Vincent Perreault, Alain Hertz +1
This paper presents a methodology for integrating machine learning techniques into metaheuristics for solving combinatorial optimization problems. Namely, we propose a general mach…
cs.AI2022
Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP
Warley Almeida Silva, Federico Bobbio, Flore Caye +4
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 co…
math.OC2021
Revisiting local branching with a machine learning lens
Defeng Liu, Matteo Fischetti, Andrea Lodi
Finding high-quality solutions to mixed-integer linear programming problems (MILPs) is of great importance for many practical applications. In this respect, the refinement heuristi…