Claude beats MIPLIB's best solutions on 72 of 203 open optimization problems, proves 45 optimal
claudeai · x · 2026-11-10
Anthropic reports Claude's results on MIPLIB, a library of optimization problems (airline crew scheduling, delivery routing): out of 203 open problems, Claude beat the listed best solution in 72 cases and proved optimality in 45. Example: timing 42 trains to cut peak power use — agents improved MIPLIB's best timetable by 2.6% in under two hours, then proved no better timetable exists. Solutions submitted to MIPLIB for public verification.
Related event: Claude Beats Known Best Solutions on 72 Open MIPLIB Problems(2 posts)→
More from Models
- Dev finds "responsibility laundering" trick to bypass Opus refusals: delegate the dirty work to another model — corbtt · 2026-11-10
- One-shot prompt builds a full game in 8 hours for ~$550 of Claude API tokens — felixrieseberg · 2026-11-10
- Claude's hidden reasoning_effort tag exposed — and it secretly reads hidden messages — josh_bickett · 2026-11-10
- Opus Keeps Butchering a Joke-Rewriting Task, Ignoring Explicit Instructions to Preserve Punchlines — ivan_bezdomny · 2026-11-10
- Claude Fable 5.2 keeps butchering jokes: can't keep premise or punchline while rewriting — ivan_bezdomny · 2026-11-10
- Dev's early take on Fable 5.2: "best model," competitors will struggle to catch up — daniel_mac8 · 2026-11-10