An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:13, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the speedup of parallel best-bound branch-and-bound algorithms |
scientific article |
Statements
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (English)
0 references
1986
0 references
This paper derives an upper bound for the speedup obtainable by any parallel branch-and-bound algorithm using the best-bound search strategy. We confirm that parallel branch-and-bound can achieve nearly linear, or even super-linear, speedup under the appropriate conditions.
0 references
traveling salesman
0 references
upper bound
0 references
parallel branch-and-bound algorithm
0 references
