AI Proves Optimal Solutions to MIPLIB Open Problems Unsolved for 9 Years

IgorCarron · x · 2026-11-20

DmitryRybin1 tested whether Astra 6.2 Max could match 300 agents of Fable 5.2 on the Open Combinatorial Optimization dataset, tackling five MIPLIB open problems that resisted large-scale tree search and human algorithm design for over 9 years: bppc6-06 proven optimal at 208 in 20 min, bab3 optimal at -656214.9542 in 34 min, assign1-10-4 optimal at 422 in 11 min, momentum3 improved to 171304.5086 with a better lower bound of 135070.9986 in 150 min, while comp12-2idx saw no improvement. Long-time MILP practitioner IgorCarron calls it simply fascinating.

Original post →

More from Models

Models channel →