Graph-based A* beats basic branch-and-bound on project scheduling
With extra pruning, A* proves optimality on all 480 RCPSP instances, versus 445 for best-first branch-and-bound.
3 stories, newest first · one card per story
With extra pruning, A* proves optimality on all 480 RCPSP instances, versus 445 for best-first branch-and-bound.
Across 31 paid engagements, the strongest Claude Code setup hit 88.39% strict feasibility and a DAQ of 0.87.
Researchers release OR-Clarify, a benchmark testing whether LLM agents ask clarifying questions before formulating optimization models from incomplete requests.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views