Towards smarter MILP solvers: A data-driven approach to branch-and-bound

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...