MIPLIB Records

Benchmark Results

MIPLIB open-instance records

The AIJ 2025 paper reported 10 new best-known solutions on MIPLIB 2017 open instances. Open instances are the most challenging problems in MIPLIB, where the optimal solution has not yet been proven.

Instances10 new best-known
BenchmarkMIPLIB 2017 Open
SourceArtificial Intelligence, 2025
Records

New best-known solutions

All instances come from the MIPLIB 2017 open set. All objectives are minimization (larger negative values are better). The "Previous best" column shows the best-known value before Local-MIP. Individual records may have been matched or improved by later solvers; check the MIPLIB website for the current state.

Instance Variables Constraints Constraint types Previous best Local-MIP
sorrell7 2,048 78,848 variable bound -196 -197
genus-sym-g31-8 3,484 32,073 knapsack, etc. -21 -23
supportcase22 7,129 260,602 mixed binary, etc. N/A† 117
cdc7-4-3-2 11,811 14,478 set packing -289 -294
genus-sym-g62-2 12,912 78,472 set partitioning, etc. -34 -38
genus-g61-25 14,380 94,735 cardinality, etc. -34 -40
ns1828997 27,275 81,725 precedence, etc. 9 8
neos-4232544-orira 87,060 180,600 aggregations, etc. 17,540,506 15,108,527.5
scpm1 500,000 5,000 set covering 554 544
scpn2 1,000,000 5,000 set covering 501 490

† First-ever feasible solution found for this instance.