Pages that link to "Item:Q1917301"
From MaRDI portal
The following pages link to Performances of parallel branch and bound algorithms with best-first search (Q1917301):
Displaying 5 items.
- Evaluation of a simple, scalable, parallel best-first search strategy (Q360118) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (Q1808184) (← links)
- A study of parallel branch-and-bound algorithms with best-bound-first search (Q1825604) (← links)
- Anomalies in parallel branch-and-bound algorithms (Q3713596) (← links)