An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms

Michael J. Quinn, Narsingh Deo. An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. BIT, 26(1):35-43, 1986.

Abstract

Abstract is missing.