mlsanityData to 14 Oct 2026

Are Your Generated Instances Truly Useful? GenBench-MILP: A Benchmark Suite for MILP Instance Generation

arXiv 2505.24779 ↗First posted 30 May 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The proliferation of machine learning-based methods for Mixed-Integer Linear Programming (MILP) instance generation has surged, driven by the need for diverse training datasets. However, a critical question remains: Are these generated instances truly useful and realistic? Current evaluation protocols often rely on superficial structural metrics or simple solvability checks, which frequently fail to capture the true computational complexity of real-world problems. To bridge this gap, we introduce GenBench-MILP, a comprehensive benchmark suite designed for the standardized and objective evaluation of MILP generators. Our framework assesses instance quality across four key dimensions: mathematical validity, structural similarity, computational hardness, and utility in downstream tasks. A distinctive innovation of GenBench-MILP is the analysis of solver-internal features -- including root node gaps, heuristic success rates, and cut plane usage. By treating the solver's dynamic behavior as an expert assessment, we reveal nuanced computational discrepancies that static graph features miss. Our experiments on instance generative models demonstrate that instances with high structural similarity scores can still exhibit drastically divergent solver interactions and difficulty levels. By providing this multifaceted evaluation toolkit, GenBench-MILP aims to facilitate rigorous comparisons and guide the development of high-fidelity instance generators.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 13 of its 37 references that are in the map. First posted on arXiv 30 May 2025.

Builds on

13 of 37 references.

References · 13

  1. 2016Variational Graph Auto-Encoderscited by 1,382
  2. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  3. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
  4. 2021SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimizationcited by 230
  5. 2020Solving Mixed Integer Programs Using Neural Networkscited by 182
  6. 2022A Survey for Solving Mixed Integer Programming via Machine Learningcited by 44
  7. 2020Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solverscited by 43
  8. 2022The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insightscited by 39
  9. 2024Towards Foundation Models for Mixed Integer Linear Programmingcited by 31
  10. 2023A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availabilitycited by 21
  11. 2024MILP-StuDio: MILP Instance Generation via Block Structure Decompositioncited by 17
  12. 2024Effective Generation of Feasible Solutions for Integer Programming via Guided Diffusioncited by 8
1 more
  1. 2023DIG-MILP: a Deep Instance Generator for Mixed-Integer Linear Programming with Feasibility Guaranteecited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.