On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (Q1808184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search |
scientific article; zbMATH DE number 1373548
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search |
scientific article; zbMATH DE number 1373548 |
Statements
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (English)
0 references
2 December 1999
0 references
search strategies
0 references
parallel branch and bound
0 references
quadratic assignment
0 references
job-shop scheduling
0 references
