An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
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.
scientific article; zbMATH DE number 3943580