ID-PaS+ : Identity-Aware Predict-and-Search for General Mixed-Integer Linear Programs
About
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 variable structures that commonly arise in real-world settings. This work extends the current Predict-and-Search (PAS) framework to parametric general parametric MIPs and introduces ID-PAS+, an identity-aware learning framework that enables the ML model to handle heterogeneous variable types 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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Large-scale Optimization | COURSE Hard | PG Mean0.4 | 4 | |
| Large-scale Optimization | MMCNP Hard | PG Mean7 | 4 | |
| Large-scale Optimization | MMCNP Very-Hard | PG Mean (%)0.12 | 4 | |
| Large-scale Optimization | SLAP Hard | PG Mean2.4 | 4 | |
| Large-scale Optimization | SLAP Very-Hard | Performance Gap (PG) Mean13 | 4 | |
| Large-scale Optimization | COURSE Very-Hard | Performance Gap (Mean)7 | 4 | |
| Large-scale Optimization | OCP Hard | PG Mean (%)8 | 4 | |
| Large-scale Optimization | OCP Very-Hard | PG Mean1.98 | 4 | |
| Mixed-Integer Programming Optimization | MMCNP (test) | Mean PG (%)7 | 3 | |
| Mixed-Integer Programming Optimization | MMCNP Hard (test) | Mean PG (%)0.0012 | 3 |