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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.