mlsanityData to 14 Oct 2026

Code Retrieval for MILP Instance Generation

arXiv 2505.11526 ↗First posted 11 May 2025math.OC cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Mixed-Integer Linear Programming (MILP) is widely used in fields such as scheduling, logistics, and planning. Enhancing the performance of MILP solvers, particularly learning-based solvers, requires substantial amounts of high-quality data. However, existing methods for MILP instance generation typically necessitate training a separate model for each problem class and are computationally intensive when generating new instances. To address these limitations, we reformulate the MILP Instance Generation task as MILP Code Generation task, enabling efficient, flexible, and interpretable instance generation through code. Since MILP instances generated from code can vary significantly in scale, we introduce MILP-EmbedSim, a new similarity metric that accurately measures the similarity between instances of varying sizes within the same problem class. Leveraging this metric, we propose MILP-Retrieval, a pipeline that retrieves generation code from library to produce MILP instances highly similar to target instance. MILP-Retrieval outperforms baselines in both MILP Code Generation and Instance Generation tasks, provides a novel perspective on MILP instance generation and opens new possibilities for learning-based solvers.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 58 references that are in the map. First posted on arXiv 11 May 2025.

Builds on

23 of 58 references.

References · 23

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  5. 2024GPT-4o System Cardcited by 4,588
  6. 2016Improved Techniques for Training GANscited by 2,970
  7. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  8. 2024NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Modelscited by 472
  9. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
  10. 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 111
  11. 2020Hybrid Models for Learning to Branchcited by 95
  12. 2023Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Modelcited by 45
11 more
  1. 2021Learning a Large Neighborhood Search Algorithm for Mixed Integer Programscited by 43
  2. 2023A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programmingcited by 41
  3. 2023Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learningcited by 37
  4. 2024The SCIP Optimization Suite 9.0cited by 37
  5. 2024Towards Foundation Models for Mixed Integer Linear Programmingcited by 31
  6. 2022Lookback for Learning to Branchcited by 27
  7. 2023A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availabilitycited by 21
  8. 2024MILP-StuDio: MILP Instance Generation via Block Structure Decompositioncited by 17
  9. 2023Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learningcited by 7
  10. 2023DIG-MILP: a Deep Instance Generator for Mixed-Integer Linear Programming with Feasibility Guaranteecited by 7
  11. 2024Machine Learning Insides OptVerse AI Solver: Design Principles and Applicationscited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.