EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Machine learning augmented branch and bound for mixed integer linear programming

Lara Scavuzzo iD, Karen Aardal, Andrea Lodi, Neil Yorke-Smith

Mathematical Programming · 2026-05 · 217 (1-2) · 123-166

DOI: 10.1007/s10107-024-02130-y ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Programming, online erschienen am 22.08.2024. Verfasst von Lara Scavuzzo und 3 weiteren Autor:innen. Beteiligte Einrichtung: Delft University of Technology, Delft, The Netherlands. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 106 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Horizon 2020 Framework Programme.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Mixed Integer Linear Programming (MILP) is a pillar of mathematical optimization that offers a powerful modeling language for a wide range of applications. The main engine for solving MILPs is the branch-and-bound algorithm. Adding to the enormous algorithmic progress in MILP solving of the past decades, in more recent years there has been an explosive development in the use of machine learning for enhancing all main tasks involved in the branch-and-bound algorithm. These include primal heuristics, branching, cutting planes, node selection and solver configuration decisions. This article presents a survey of such approaches, addressing the vision of integration of machine learning and mathematical optimization as complementary technologies, and how this integration can benefit MILP solving. In particular, we give detailed attention to machine learning algorithms that automatically optimize some metric of branch-and-bound efficiency. We also address appropriate MILP representations, benchmarks and software tools used in the context of applying learning algorithms.

Schlagwörter

Stichwörter der Autor:innen

BenchmarksBranch and boundMachine learningMetricsMixed integer linear programming

Autor:innen und Institutionen

  • Delft University of Technology, Delft, The Netherlands.
  • Jacobs Technion-Cornell Institute, Cornell Tech and Technion-IIT, New York, NY USA.

ORCID-Profile: Lara Scavuzzo

Förderung

  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek
  • Horizon 2020 Framework Programme

Zitieren

APA

Scavuzzo, L., Aardal, K., Lodi, A., & Yorke-Smith, N. (2026). Machine learning augmented branch and bound for mixed integer linear programming. Mathematical Programming, 217(1-2), 123-166. https://doi.org/10.1007/s10107-024-02130-y

Vancouver

Scavuzzo L, Aardal K, Lodi A, Yorke-Smith N. Machine learning augmented branch and bound for mixed integer linear programming. Mathematical Programming. 2026;217(1-2):123-166. doi:10.1007/s10107-024-02130-y

BibTeX
@article{Scavuzzo2026,
  author = {Scavuzzo, Lara and Aardal, Karen and Lodi, Andrea and Yorke-Smith, Neil},
  title = {Machine learning augmented branch and bound for mixed integer linear programming},
  journal = {Mathematical Programming},
  year = {2026},
  volume = {217},
  number = {1-2},
  pages = {123--166},
  doi = {10.1007/s10107-024-02130-y}
}
Kostenlos starten →