FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programming
Hongpei Li, Hui Yuan, Han Zhang, Jianghao Lin, Dongdong Ge, Mengdi Wang, Yinyu Ye
Abstract
Mixed-Integer Linear Programming (MILP) is a foundational tool for complex decision-making problems. However, the NP-hard nature of MILP presents a significant computational challenge, motivating the development of machine learningbased heuristic solutions to accelerate downstream solvers. While recent generative models have shown promise in learning powerful heuristics, they suffer from a critical limitation. That is, they model the distribution of only the integer variables and fail to capture the intricate coupling between integer and continuous variables, creating an information bottleneck and ultimately leading to suboptimal solutions. To this end, we propose Joint Continuous-Integer Flow for Mixed-Integer Linear Programming (FMIP), which is the first generative framework that models the joint distribution of both integer and continuous variables for MILP solutions. Built upon the joint modeling paradigm, a holistic guidance mechanism is designed to steer the generative trajectory, actively refining solutions toward optimality and feasibility during the inference process. Extensive experiments on eight standard MILP benchmarks demonstrate the superior performance of FMIP against existing baselines, reducing the primal gap by 41.34% on average. Moreover, we show that FMIP is fully compatible with arbitrary backbone networks and various downstream solvers, making it well-suited for a broad range of real-world MILP applications. Our code is available * .
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 f7231c80-4252-453e-81a6-560e3b75bbd3Cited by top-tier papers2
- Unsupervised Diffusion Solver for Combinatorial Optimization via Combinatorial Adjoint MatchingShengyu Feng, Tarun Suresh, Yiming YangICML 2026 · 1 citation
- Unsupervised Neural Langevin Sampler for Mixed Integer Linear ProgrammingYixin Huang, Shengyu Feng, Yiming YangICML 2026
Builds on20
- Improved Denoising Diffusion Probabilistic ModelsAlexander Quinn Nichol, Prafulla DhariwalICML 2021 · 5,234 citations
- How Attentive are Graph Attention Networks?Shaked Brody, Uri Alon, Eran YahavICLR 2022 · 1,717 citations
- DIFUSCO: Graph-based Diffusion Solvers for Combinatorial OptimizationZhiqing Sun, Yiming YangNeurIPS 2023 · 356 citations
- Reinforcement Learning for Integer Programming: Learning to CutYunhao Tang, Shipra Agrawal, Yuri FaenzaICML 2020 · 224 citations
- Hybrid Models for Learning to BranchPrateek Gupta, Maxime Gasse, Elias B. Khalil, Pawan Kumar Mudigonda et al.NeurIPS 2020 · 179 citations
Related papers
- A General Neural Backbone for Mixed-Integer Linear Optimization via Dual AttentionPeixin Huang, Yaoxin Wu, Yining Ma, Cathy Wu et al.ICML 2026
- 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
- Towards Foundation Models for Mixed Integer Linear ProgrammingSirui Li, Janardhan Kulkarni, Ishai Menache, Cathy Wu et al.ICLR 2025
- MIP-GNN: A Data-Driven Framework for Guiding Combinatorial SolversElias B. Khalil, Christopher Morris, Andrea LodiAAAI 2022 · 75 citations
- Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution PredictionJian-Ya Ding, Chao Zhang, Lei Shen, Shengyin Li et al.AAAI 2020 · 119 citations
