On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search (Q1808184): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:17, 1 February 2024
scientific article
| 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 |
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
