The following pages link to Multiple stack branch and bound (Q922704):
Displaying 4 items.
- An efficient data structure for branch-and-bound algorithm (Q558042) (← links)
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)