MILP-FBGen: LP/MILP Instance Generation with Feasibility/Boundedness
Yahong Zhang, Chenchen Fan, Donghui Chen, Congrui Li, Wenli Ouyang, Mingda Zhu, Junchi Yan
Abstract
Machine learning (ML) has been actively adopted in Linear Programming (LP) and Mixed-Integer Linear Programming (MILP), whose potential is hindered by instance scarcity. Current synthetic instance generation methods often fall short in closely mirroring the distribution of original datasets or ensuring the feasibility and boundedness of the generated data -a critical requirement for obtaining reliable supervised labels in model training. In this paper, we present a diffusion-based LP/MILP instance generative framework called MILP-FBGen. It strikes a balance between structural similarity and novelty while maintaining feasibility/boundedness via a meticulously designed structure-preserving generation module and a feasibility/boundednessconstrained sampling module. Our method shows superiority on two fronts: 1) preservation of key properties (hardness, feasibility, and boundedness) of LP/MILP instances, and 2) enhanced performance on downstream tasks. Extensive studies show two-fold superiority that our method ensures higher distributional similarity and 100% feasibility in both easy and hard datasets, surpassing current state-of-the-art techniques.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e470f8b4-8e47-45ef-ac53-afb6afcd57f9Cited by top-tier papers3
- Principled Data Augmentation for Learning to Solve Quadratic Programming ProblemsChendi Qian, Christopher MorrisNeurIPS 2025 · 3 citations
- Towards Foundation Models for Mixed Integer Linear ProgrammingSirui Li, Janardhan Kulkarni, Ishai Menache, Cathy Wu et al.ICLR 2025
- Validating Mixed-Integer Programming SolversXintong Zhou, Zhenyang Xu, Chengnian SunICSE 2026
Builds on11
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- DIFUSCO: Graph-based Diffusion Solvers for Combinatorial OptimizationZhiqing Sun, Yiming YangNeurIPS 2023 · 356 citations
- Hybrid Models for Learning to BranchPrateek Gupta, Maxime Gasse, Elias B. Khalil, Pawan Kumar Mudigonda et al.NeurIPS 2020 · 179 citations
- Parameterizing Branch-and-Bound Search Trees to Learn Branching PoliciesGiulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua BengioAAAI 2021 · 123 citations
- Analog Bits: Generating Discrete Data using Diffusion Models with Self-ConditioningTing Chen, Ruixiang Zhang, Geoffrey E. HintonICLR 2023 · 80 citations
Related papers
- A Deep Instance Generative Framework for MILP Solvers Under Limited Data AvailabilityZijie Geng, Xijun Li, Jie Wang, Xiao Li et al.NeurIPS 2023 · 35 citations
- MILP-StuDio: MILP Instance Generation via Block Structure DecompositionHaoyang Liu, Jie Wang, Wanbo Zhang, Zijie Geng et al.NeurIPS 2024 · 19 citations
- ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance GenerationZiao Guo, Yang Li, Chang Liu, Wenli Ouyang et al.ICML 2024 · 9 citations
- Generative Branching for Mixed-Integer Linear ProgrammingRuobing Wang, Xin Li, Yangchuan Wang, Zijian Zhang et al.AAAI 2026
- Effective Generation of Feasible Solutions for Integer Programming via Guided DiffusionHao Zeng, Jiaqi Wang, Avirup Das, Junying He et al.KDD 2024
