A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
Authors:
- Ten-Hwang LaiTLTen-Hwang Lai
- Alan SpragueASAlan Sprague
- 22 October 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (3) , 119-122
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Performance of parallel branch-and-bound algorithmsIEEE Transactions on Computers, 1985
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search ProblemsIEEE Transactions on Computers, 1984
- Random Trees and the Analysis of Branch and Bound ProceduresJournal of the ACM, 1984
- Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1976
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974