Pages that link to "Item:Q1825604"
From MaRDI portal
The following pages link to A study of parallel branch-and-bound algorithms with best-bound-first search (Q1825604):
Displaying 13 items.
- Evaluation of a simple, scalable, parallel best-first search strategy (Q360118) (← links)
- Parallel branch and bound on fine-grained hypercube multiprocessors (Q916373) (← links)
- Performance analysis of branch-and-bound skeletons (Q984170) (← links)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
- Simple approaches to parallel branch and bound (Q1208509) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- Design of parallel algorithms for the single resource allocation problem (Q1584827) (← links)
- On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (Q1808184) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- Conditional optimization problems: fractional order case (Q1949545) (← links)
- An analysis of budgeted parallel search on conditional Galton-Watson trees (Q2309473) (← links)
- On Hash-Based Work Distribution Methods for Parallel Best-First Search (Q4591193) (← links)
- Cyclic best first search: Using contours to guide branch‐and‐bound algorithms (Q4632957) (← links)
