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.
Stories per day · 30 days
1 stories, newest first · one card per story
1 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.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views