Towards smarter MILP solvers: A data-driven approach to branch-and-bound
L.V. Scavuzzo Montaña (TU Delft - Discrete Mathematics and Optimization)
K. Aardal – Promotor (TU Delft - Discrete Mathematics and Optimization)
Neil Yorke-Smith – Copromotor (TU Delft - Algorithmics)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
The available technology to solve Mixed Integer Linear Programs (MILPs) has experienced dramatic improvements in the past two decades. Pushing this algorithmic progress further is essential for solving even more complex optimization problems that arise in practice. This thesis examines various methods to enhance Branch-and-Bound (B&B) based MILP solvers, focusing on areas such as branching and Machine Learning (ML) assisted rules. Through our analysis of current methodologies and the introduction of novel techniques, this thesis contributes to the development of more efficient and adaptive MILP solvers...