Skip to content
Open access

ID-PaS+: Identity-Aware Predict-and-Search for Solving General Mixed-Integer Linear Programs

Aug 2026 · Proceedings of the International Symposium on Combinatorial Search · 0 citations

TL;DR

This work extends the current Predict-and-Search (PaS) framework to parametric general MIPs and introduces ID-PaS+, an identity-aware learning framework that enables the ML model to handle heterogeneous variables more effectively.

Abstract

Mixed-Integer Linear Programs (MIPs) are powerful and flexible tools for modeling a wide range of real-world combinatorial optimization problems. Predict-and-Search methods operate by using a predictive model to estimate promising variable assignments and then guiding a search procedure toward high-quality solutions. Recent research has demonstrated that incorporating machine learning (ML) into the Predict-and-Search framework significantly enhances its performance. Still, it is restricted to binary-only problems and overlooks the presence of fixed variables structure that commonly arise in real-world settings. This work extends the current Predict-and-Search (PaS) framework to parametric general MIPs and introduces ID-PaS+, an identity-aware learning framework that enables the ML model to handle heterogeneous variables more effectively. Experiments on several real-world large-scale problems demonstrate that ID-PaS+ consistently achieves superior performance compared to the state-of-the-art solver Gurobi and PaS.

Read PDF

Similar papers

Preprint Aug 2026

Learning Early-to-Final Solution Consistency for MILP Acceleration

This paper finds that solutions produced at the early search stage of MILP solvers are often structurally close to the solutions found after full-budget search, and proposes a new solver-informed paradigm that shifts the learning target from variable assignment to early-to-final consistency.

Guanli Li, Chengrui Gao, Chenguang Wang et al. · 0 citations
Preprint Aug 2026

SHSP: Structure-Aware Hierarchical Solution Prediction for Mixed-Integer Linear Programming

The Structure-Aware Hierarchical Solution Prediction (SHSP) framework is proposed that replaces the parallel marginal decoding of one-shot methods with a novel hierarchical conditional decoding mechanism and significantly outperforms existing one-shot prediction baselines.

Zhe-Rong Zhang, Guanli Li, Chengrui Gao et al. · 0 citations
Conference Open access Sep 2026

LLM-guided Cutting-plane Management for Mixed-integer Linear Programming

This work proposes an LLM-guided cutting-plane management framework that removes dependence on domain-specific training data and substantially reduces reliance on expert-crafted configurations.

Zetao Zheng, Zhe Wang, Jie Shao · 0 citations
Open access Jul 2026

The quadratic multidimensional knapsack problem: exact, heuristic, and machine learning methods

This paper presents a multi-faceted approach to solving the quadratic multidimensional knapsack problem (QMDKP), an NP-hard nonlinear combinatorial optimization problem that has received limited attention in the literature. We introduce a new testbed of QMDKP instances with induced profit-weight correlations and evalua...

R. J. Forrester, Lucas A. Waddell · 0 citations
Jul 2026

AutoPref: Automatic Discovery of Task-Specific Preference Objectives for Neural Combinatorial Optimization

AutoPref is presented, the first LLM-guided framework for automated preference-objective discovery in NCO, which consistently outperforms strong hand-designed baselines across problem scales, demonstrating the benefits and scalability of automated objective discovery for NCO.

Shengda Gu, Kai Li, Xin-Yi Ke et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.