mlsanityData to 14 Oct 2026

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

arXiv 2512.10211 ↗First posted 11 Dec 2025cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 11 Dec 2025.

Builds on

22 of 37 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021How Attentive are Graph Attention Networks?cited by 835
  3. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
  4. 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 210
  5. 2023A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programmingcited by 41
  6. 2019Online Mixed-Integer Optimization in Millisecondscited by 38
  7. 2023Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learningcited by 37
  8. 2023End-to-End Feasible Optimization Proxies for Large-Scale Economic Dispatchcited by 35
  9. 2022PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programmingcited by 32
  10. 2024Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methodscited by 15
  11. 2024Dual Lagrangian Learning for Conic Optimizationcited by 11
  12. 2024Optimization Over Trained Neural Networks: Taking a Relaxing Walkcited by 10
10 more
  1. 2024Multi-task Representation Learning for Mixed Integer Linear Programmingcited by 7
  2. 2024Learning Backdoors for Mixed Integer Linear Programs with Contrastive Learningcited by 5
  3. 2024Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problemcited by 4
  4. 2025PROPEL: Supervised and Reinforcement Learning for Large-Scale Supply Chain Planningcited by 4
  5. 2020A General Large Neighborhood Search Framework for Solving Integer Linear Programscited by 2
  6. 2023Learning for Online Mixed-Integer Model Predictive Control with Parametric Optimality Certificatescited by 2
  7. 2024Verification of First-Order Methods for Parametric Quadratic Optimizationcited by 2
  8. 2025Practice-Based Optimization for the Strategic Locomotive Assignment Problemcited by 2
  9. 2025A Fair OR-ML Framework for Resource Substitution in Large-Scale Networkscited by 2
  10. 2025Domain-Aware Machine Learning for Accelerating MILP-Based Motion Planning with Temporal Logic and Chance Constraintscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.