• An upper bound for the speedup...

Result: An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

Title:
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
Authors:
Quinn, Michael J., Deo, Narsingh
Source:
BIT Numerical Mathematics. March 1986 26(1):35-43
Database:
Springer Nature Journals