Claude agents beat best-known solutions on 72 of 203 open MIPLIB optimization problems
claudeai · x · 2026-11-10
MIPLIB is a library of hard mixed-integer optimization problems like airline crew scheduling and delivery routing. Of 203 problems listed as open, Claude beat the listed mathematical solution in 72 cases and proved optimality in 45. The chart shows teams of up to 300 agents running an earlier Claude Fable 5.2: 54 better solutions, 18 both better and proved, 27 proofs of optimality, plus 104 other problems attempted. Proofs have so far only been checked by separate Claude agents.
Related event: Claude Beats Known Best Solutions on 72 Open MIPLIB Problems(2 posts)→
More from Models
- Reddit users complain free Gemini is getting worse and less useful — rupomthegreat · 2026-11-10
- Terminal-Bench-Science top score jumps 30% to 74.6% in four months, evals saturating — geoffwolfe · 2026-11-10
- Fable takes 5-point lead on Slopalytics, and AI Twitter is losing it — beffjezos · 2026-11-10
- Founder's real-world test pans new model as pricier and buggier, reverts to older version — bindureddy · 2026-11-10
- Researcher argues Fable 5.2 is a robot-data VLM behind an agentic harness — ZeeshanZiaML · 2026-11-10
- GPT-6 Astra vs Fable 5.2: Head-to-Head Pixel Art Showdown — Angaisb_ · 2026-11-10