mlsanityData to 7 Oct 2026

Data-driven Mixed Integer Optimization through Probabilistic Multi-variable Branching

arXiv 2305.12352 ↗First posted 21 May 2023math.OC cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a Pre-trained Mixed Integer Optimization framework (PreMIO) that accelerates online mixed integer program (MIP) solving with offline datasets and machine learning models. Our method is based on a data-driven multi-variable cardinality branching procedure that splits the MIP feasible region using hyperplanes chosen by the concentration inequalities. Unlike most previous ML+MIP approaches that either require complicated implementation or suffer from a lack of theoretical justification, our method is simple, flexible, provable, and explainable. Numerical experiments on both classical OR benchmark datasets and real-life instances validate the efficiency of our proposed method.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 54 references that are in the map. First posted on arXiv 21 May 2023.

Builds on

18 of 54 references.

References · 18

  1. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  2. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
  3. 2020Solving Mixed Integer Programs Using Neural Networkscited by 178
  4. 2020Hybrid Models for Learning to Branchcited by 95
  5. 2018Learning to Branchcited by 78
  6. 2020Parameterizing Branch-and-Bound Search Trees to Learn Branching Policiescited by 62
  7. 2022MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solverscited by 48
  8. 2022Learning to branch with Tree MDPscited by 45
  9. 2021Learning a Large Neighborhood Search Algorithm for Mixed Integer Programscited by 41
  10. 2023A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programmingcited by 40
  11. 2019Learning to Solve Large-Scale Security-Constrained Unit Commitment Problemscited by 38
  12. 2021Learning Large Neighborhood Search Policy for Integer Programmingcited by 35
6 more
  1. 2022Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cutscited by 19
  2. 2022Cardinal Optimizer (COPT) User Guidecited by 16
  3. 2022An Improved Reinforcement Learning Algorithm for Learning to Branchcited by 14
  4. 2021Improved Sample Complexity Bounds for Branch-and-Cutcited by 13
  5. 2016Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programscited by 2
  6. 2020Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problemcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.