mlsanityData to 7 Oct 2026

DIG-MILP: a Deep Instance Generator for Mixed-Integer Linear Programming with Feasibility Guarantee

arXiv 2310.13261 ↗First posted 20 Oct 2023cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Mixed-integer linear programming (MILP) stands as a notable NP-hard problem pivotal to numerous crucial industrial applications. The development of effective algorithms, the tuning of solvers, and the training of machine learning models for MILP resolution all hinge on access to extensive, diverse, and representative data. Yet compared to the abundant naturally occurring data in image and text realms, MILP is markedly data deficient, underscoring the vital role of synthetic MILP generation. We present DIG-MILP, a deep generative framework based on variational auto-encoder (VAE), adept at extracting deep-level structural features from highly limited MILP data and producing instances that closely mirror the target data. Notably, by leveraging the MILP duality, DIG-MILP guarantees a correct and complete generation space as well as ensures the boundedness and feasibility of the generated instances. Our empirical study highlights the novelty and quality of the instances generated by DIG-MILP through two distinct downstream tasks: (S1) Data sharing, where solver solution times correlate highly positive between original and DIG-MILP-generated instances, allowing data sharing for solver tuning without publishing the original data; (S2) Data Augmentation, wherein the DIG-MILP-generated instances bolster the generalization performance of machine learning models tasked with resolving MILP problems.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 18 of its 61 references that are in the map. First posted on arXiv 20 Oct 2023.

Builds on

18 of 61 references.

References · 18

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  4. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  5. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  6. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  7. 2016Variational Graph Auto-Encoderscited by 1,373
  8. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  9. 2020Designing Network Design Spacescited by 954
  10. 2017Generative Adversarial Networks: An Overviewcited by 588
  11. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  12. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
6 more
  1. 2021SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimizationcited by 229
  2. 2020Solving Mixed Integer Programs Using Neural Networkscited by 178
  3. 2022On Representing Linear Programs by Graph Neural Networkscited by 39
  4. 2023A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availabilitycited by 21
  5. 2017Warmstarting of Model-based Algorithm Configurationcited by 17
  6. 2021On the Complexity of Inverse Mixed Integer Linear Optimizationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 5; 2026: 1.

7 papers.