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
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1018952429396 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1554631849 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 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
