atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming

ICLR 2025 · Learning theory and algorithms › Combinatorial and search optimization · approach: Learning branch-and-cut for MILP · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Apollo-MILP alternates GNN-based prediction of partial MILP solutions with a trust-region solver correction, and fixes only variables where predicted and reference solutions agree (UEBO-based consistency criterion), reducing the solution gap by over 50% on CA, SC, IP, WA benchmarks.

Problem

Neural MILP solution prediction methods (Neural Diving, Predict-and-Search) fix predicted variable values, which can yield low-quality or infeasible reduced problems when predictions are inaccurate.

Approach

Use the solver's trust-region search output as a reference solution to correct the GNN prediction, then fix only variables where prediction and reference agree, justified by an uncertainty-based error upper bound (UEBO) on KL divergence.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Apollo-MILP instead of ConPS with GurobiGurobi solving on CA · CA testabsolute primal gap: 152.49 -> 129.41Helped
use Apollo-MILP instead of ConPS with GurobiGurobi solving on SC · SC testabsolute primal gap: 0.25 -> 0.10Helped
use Apollo-MILP instead of ConPS with GurobiGurobi solving on IP · IP testabsolute primal gap: 0.19 -> 0.00Helped
use Apollo-MILP instead of ConPS with GurobiGurobi solving on WA · WA testabsolute primal gap: 0.49 -> 0.00Helped
use Apollo-MILP instead of ConPS with SCIPSCIP solving on CA · CA testabsolute primal gap: 792.33 -> 777.25Helped
use Apollo-MILP instead of ConPS with SCIPSCIP solving on SC · SC testabsolute primal gap: 0.95 -> 0.55Helped
use Apollo-MILP instead of ConPS with SCIPSCIP solving on IP · IP testabsolute primal gap: 4.84 -> 3.96Helped
use Apollo-MILP instead of ConPS with SCIPSCIP solving on WA · WA testabsolute primal gap: 4.45 -> 4.41Helped
replace consistency-based fixing with direct fixing of reference partial solutions (ablation)Apollo-MILP on IP · IP testabsolute primal gap: 0.00 -> 0.32Hurt
replace consistency-based fixing with direct fixing of reference partial solutions (ablation)Apollo-MILP on WA · WA testabsolute primal gap: 0.00 -> 0.52Hurt
replace consistency-based fixing with four rounds of PS fixing predicted partial solutions (ablation)Apollo-MILP on IP · IP testabsolute primal gap: 0.00 -> 0.28Hurt
replace consistency-based fixing with four rounds of PS fixing predicted partial solutions (ablation)Apollo-MILP on WA · WA testabsolute primal gap: 0.00 -> 0.45Hurt

Surprising findings

Limitations

Experimental setup

Datasets: Combinatorial auctions (CA) Set covering (SC) NeurIPS ML4CO 2021 item placement (IP) NeurIPS ML4CO 2021 workload appointment (WA)

Benchmarks: CA SC IP WA IIS (MIPLIB subset)

Metrics: best objective absolute primal gap relative primal gap

Baselines: Gurobi SCIP Neural Diving Predict-and-Search ConPS Warm-starting Gurobi

Builds on: Predict-and-Search Neural Diving ConPS

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy