MILP-FBGen: LP/MILP Instance Generation with Feasibility/Boundedness
Yahong Zhang, Chenchen Fan, Donghui Chen, Congrui Li, Wenli Ouyang, Mingda Zhu, Junchi Yan
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Principled Data Augmentation for Learning to Solve Quadratic Programming ProblemsChendi Qian, Christopher MorrisNeurIPS 2025 · 被引用 3 次
- Towards Foundation Models for Mixed Integer Linear ProgrammingSirui Li, Janardhan Kulkarni, Ishai Menache, Cathy Wu 等ICLR 2025
- Validating Mixed-Integer Programming SolversXintong Zhou, Zhenyang Xu, Chengnian SunICSE 2026
它引用的顶会 Paper11
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 被引用 35,902 次
- DIFUSCO: Graph-based Diffusion Solvers for Combinatorial OptimizationZhiqing Sun, Yiming YangNeurIPS 2023 · 被引用 356 次
- Hybrid Models for Learning to BranchPrateek Gupta, Maxime Gasse, Elias B. Khalil, Pawan Kumar Mudigonda 等NeurIPS 2020 · 被引用 179 次
- Parameterizing Branch-and-Bound Search Trees to Learn Branching PoliciesGiulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua BengioAAAI 2021 · 被引用 123 次
- Analog Bits: Generating Discrete Data using Diffusion Models with Self-ConditioningTing Chen, Ruixiang Zhang, Geoffrey E. HintonICLR 2023 · 被引用 80 次
相关 Paper
- A Deep Instance Generative Framework for MILP Solvers Under Limited Data AvailabilityZijie Geng, Xijun Li, Jie Wang, Xiao Li 等NeurIPS 2023 · 被引用 35 次
- MILP-StuDio: MILP Instance Generation via Block Structure DecompositionHaoyang Liu, Jie Wang, Wanbo Zhang, Zijie Geng 等NeurIPS 2024 · 被引用 19 次
- ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance GenerationZiao Guo, Yang Li, Chang Liu, Wenli Ouyang 等ICML 2024 · 被引用 9 次
- Generative Branching for Mixed-Integer Linear ProgrammingRuobing Wang, Xin Li, Yangchuan Wang, Zijian Zhang 等AAAI 2026
- Effective Generation of Feasible Solutions for Integer Programming via Guided DiffusionHao Zeng, Jiaqi Wang, Avirup Das, Junying He 等KDD 2024
