A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions

DOI10.1016/0020-0190(86)90109-2zbMath0653.68012MaRDI QIDQ1107978

Ten-Hwang Lai, Alan P. Sprague

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90109-2

zbMATH Keywords

anomaly; parallel computation; branch-and-bound; best-bound-first

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68W99: Algorithms in computer science

Related Items

Branch-and-bound and parallel computation: A historical note, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, Branch-and-bound as a higher-order function, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

Cites Work

• Unnamed Item
• Random Trees and the Analysis of Branch and Bound Procedures
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Performance of parallel branch-and-bound algorithms
• Anomalies in parallel branch-and-bound algorithms
• ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems