An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940)
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: An upper bound for the speedup of parallel best-bound branch-and-bound algorithms |
scientific article; zbMATH DE number 3943580
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the speedup of parallel best-bound branch-and-bound algorithms |
scientific article; zbMATH DE number 3943580 |
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
0 references
