Machine learning augmented branch and bound for mixed integer linear programming

DOI10.1007/S10107-024-02130-YMaRDI QIDQ7316967zbMATH OpenFDO

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

Publication date 21 August 2026

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02130-Y

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
• A Computational Study of Search Strategies for Mixed Integer Programming
• A machine learning-based approximation of strong branching
• A Survey of Zero-shot Generalisation in Deep Reinforcement Learning
• Adaptive cut selection in mixed-integer linear programming
• Adaptive large neighborhood search for mixed integer programming
• Adaptive subgradient methods for online learning and stochastic optimization
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• Branching on general disjunctions
• Branching rules revisited
• Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
• Deep learning
• Deep reinforcement learning. Frontiers of artificial intelligence
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• Estimating the Size of Branch-and-Bound Trees
• Gomory cuts revisited
• Handbooks in operations Research \& management science: Transportation
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• Integer Programming
• Integer Programming
• Interior point methods 25 years later
• Learning a classification of mixed-integer quadratic programming problems
• Learning MILP resolution outcomes before reaching time-limit
• Learning when to use a decomposition
• Local branching
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Measuring the impact of branching rules for mixed-integer programming
• Measuring the impact of primal heuristics
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed integer programming: analyzing 12 years of progress
• Online learning for scheduling MIP heuristics
• Paramils: an automatic algorithm configuration framework
• Presolve Reductions in Mixed Integer Programming
• Production Planning by Mixed Integer Programming
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Reinforcement learning for variable selection in a branch and bound algorithm
• Revival of the Gomory cuts in the 1990's
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• The generalized independent set problem: polyhedral analysis and solution approaches
• Theoretical challenges towards cutting-plane selection

Cited in

(1)

• Learning to choose branching rules for nonconvex MINLPs

This page was built for publication: Machine learning augmented branch and bound for mixed integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316967)