BenLOC: A Benchmark for Learning to Configure MIP Optimizers
Not on the map. Why?
Abstract (arXiv)
The automatic configuration of Mixed-Integer Programming (MIP) optimizers has become increasingly critical as the large number of configurations can significantly affect solver performance. Yet the lack of standardized evaluation frameworks has led to data leakage and over-optimistic claims, as prior studies often rely on homogeneous datasets and inconsistent experimental setups. To promote a fair evaluation process, we present BenLOC, a comprehensive benchmark and open-source toolkit, which not only offers an end-to-end pipeline for learning instance-wise MIP optimizer configurations, but also standardizes dataset selection, train-test splits, feature engineering and baseline choice for unbiased and comprehensive evaluations. Leveraging this framework, we conduct an empirical analysis on five well-established MIP datasets and compare classical machine learning models with handcrafted features against state-of-the-art deep-learning techniques. The results demonstrate the importance of datasets, features and baseline criteria proposed by BenLOC and the effectiveness of BenLOC in providing unbiased and comprehensive evaluations.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 3 Jun 2025.
Builds on
15 of 26 references.
References · 15
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
- 2021A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directionscited by 144
- 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 111
- 2017Maximum Resilience of Artificial Neural Networkscited by 97
- 2022MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solverscited by 49
- 2021Learning to Select Cuts for Efficient Mixed-Integer Programmingcited by 48
- 2022The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insightscited by 39
- 2022Learning to Use Local Cutscited by 11
- 2023Learning to Pivot as a Smart Expertcited by 9
Built on by
Citing papers per year: 2026: 1.
1 paper.