Performances of parallel branch and bound algorithms with best-first search

Discrete Applied Mathematics

Volumn 66, Issue 1, 1996, Pages 57-74

  Mans, Bernard ^a   Roucairol, Catherine ^b  

^a CARLETON UNIVERSITY   (Canada)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

Anomalies; Branch and bound algorithm; Consistency; Parallel processing; Scalability; Speed up

Indexed keywords

EID: 0042475361     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00137-3     Document Type: Article

References (15)

1. F.W. Burton, M.M. Huntbach, G.P. McKeown and V.J. Rayward-Smith, Parallelism in branch-and-bound algorithms, Research Report CSA-3-1983, University of East Anglia, Norwich, 1983.
2. B. Fox, J. Lenstra, A. Rinnooy Kan and L. Schrage, Branching from the largest upper bound: folklore and fact, European J. Oper. Res. 2 (1978) 191-194.
3. B. Gendron and T.G. Crainic, Parallel branch-and-bound algorithms: survey and synthesis, Oper. Res. 42(6) (1994) 1042-1066.
4. T. Ibaraki, Theoretical comparisons of search strategies in branch-and-bound algorithms, Internat. J. Comput. Inform. Sci. 5(4) (1976) 315-344.
5. T. Ibaraki, Enumerative Approaches to Combinatorial Optimization, Ann. Oper. Res. (Baltzer, Basel, 1987).
6. T.-H. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, in: Proc. International Conference on Parallel Processing (1983) 183-190.
7. T.-H. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, Commun. ACM 27 (1984) 594-602.
8. T.-H. Lai and A. Sprague, Performance of parallel branch-and-bound alogrithms, IEEE Trans. Comput. C34 (1985) 962-964.
9. B. Le Cun, B. Mans and C. Roucairol, Comparison of concurrent priority queues for branch and bound algorithms, RR MASI-92-65, MASI, Université Paris 6, France, October 1992.
10. G.-J. Li and B.W. Wah, Computational efficiency of parallel approximate branch-and-bound algorithms, in: Proceedings 1984 International Conf. on Parallel Processing (1984) 473-480.
11. G.-J. Li and B.W. Wah, Coping with anomalies in parallel branch-and-bound, IEEE Trans. Comput. C-35(6) (1986) 568-573.
12. G.-J. Li and B.W. Wah, Computational efficiency of parallel combinatorial or-tree searches, IEEE Trans. Software Eng. 16(1) (1990) 13-30.
13. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 182).
14. M.J. Quinn and N. Deo, An upper bound for the speedup of parallel branch and bound algorithms, BIT 26 (1986) 35-43.
15. V.A. Saletore and L.V. Kale, Consistent linear speedups to a first solution in parallel state-space search, in: AAAI90-Proceedings Eighth National Conference on Artificial Intelligence, Vols. 1-2 (1990) 227-233.