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.

Authors

Michael J. Quinn

This author has not been identified. Look up 'Michael J. Quinn' in Google

Narsingh Deo

This author has not been identified. Look up 'Narsingh Deo' in Google