Learning Early-to-Final Solution Consistency for MILP Acceleration

๐Ÿ“… 2026-08-20
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
ๆœฌๆ–‡ๆๅ‡บไธ€็งๆ–ฐๆ–นๆณ•๏ผŒ้€š่ฟ‡้ข„ๆต‹ๅ˜้‡ๅœจๆ—ฉๆœŸๆœ็ดข้˜ถๆฎตๅ’Œๆœ€็ปˆ่งฃไน‹้—ด็š„ไธ€่‡ดๆ€งๆฅๅŠ ้€ŸMILPๆฑ‚่งฃ่ฟ‡็จ‹๏ผŒไปŽ่€Œๆ้ซ˜ๆฑ‚่งฃๆ•ˆ็އๅ’Œ่ดจ้‡ใ€‚
๐Ÿ“ Abstract
Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making. Owing to their NP-hardness, however, modern solvers may struggle to find high-quality solutions for challenging MILP instances within practical time limits. Recent learning-based approaches seek to accelerate MILP solving by directly predicting high-quality solutions from static instance-level features, such as variable-constraint bipartite graphs. Yet accurate solution prediction from instance features alone is difficult, and these methods largely overlook the information revealed during the solver's search process. In this paper, we find that solutions produced at the early search stage of MILP solvers, which are computationally cheap to obtain, are often structurally close to the solutions found after full-budget search. Motivated by this observation, we propose a new solver-informed paradigm that shifts the learning target from variable assignment to early-to-final consistency: for each variable, we predict whether its early-stage assignment should persist in full-budget solutions. The predicted consistency naturally guides downstream search, for instance by fixing the assignments deemed consistent. At inference time, we further ensemble consistency predictions across multiple early-stage solutions to improve robustness. Experiments across four MILP benchmarks show our method improves prediction-guided search across diverse downstream pipelines. With Gurobi, our proposed method reduces the primal gap by 56.9% on average and closes it completely on combinatorial auction instances. Besides, we transferred the Gurobi-trained model zero-shot to SCIP without adaptation, achieving a 36.4% average gap reduction across benchmarks.
Problem

Research questions and friction points this paper is trying to address.

Mixed-Integer Linear Programming
solution prediction
solver's search process
Innovation

Methods, ideas, or system contributions that make the work stand out.

early-to-final consistency
solver-informed paradigm
consistency prediction
ensemble consistency predictions
G
Guanlin Li
State Key Laboratory of Novel Software Technology, Nanjing University; School of Artificial Intelligence, Nanjing University
Chengrui Gao
Chengrui Gao
PhD student, Nanjing University
Learning to OptimizeCombinatorial OptimizationChip PlacementReinforcement Learning
C
Chenguang Wang
State Key Laboratory of Novel Software Technology, Nanjing University; School of Artificial Intelligence, Nanjing University
H
Haopu Shang
State Key Laboratory of Novel Software Technology, Nanjing University; School of Artificial Intelligence, Nanjing University
Z
Zherong Zhang
State Key Laboratory of Novel Software Technology, Nanjing University; School of Artificial Intelligence, Nanjing University
Ke Xue
Ke Xue
Nanjing University
Black-Box OptimizationMachine Learning
J
Jixiang Lu
State Key Laboratory of Technology and Equipment for Defense Against Power System Operational Risks, Nari Technology Co., Ltd.
W
Weiyong Yang
State Key Laboratory of Technology and Equipment for Defense Against Power System Operational Risks, Nari Technology Co., Ltd.
Chao Qian
Chao Qian
Nanjing University
Artificial intelligenceevolutionary algorithmsmachine learning