Coping with anomalies in parallel branch-and-bound algorithms

Authors:
Guo-Jie Li;Benjamin W. Wah
Affiliations:
Univ. of Illinois, Urbana, IL;Univ. of Illinois, Urbana, IL
Venue:
IEEE Transactions on Computers - The MIT Press scientific computation series
Year:
1986

Citing 11
Cited 9

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search

IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
Random Trees and the Analysis of Branch and Bound Procedures

Journal of the ACM (JACM)
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
MANIP-a parallel computer system for implementing branch and bound algorithms

ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

IEEE Transactions on Computers
Multiprocessing of Combinatorial Search Problems

Computer
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures

Artificial Intelligence

Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
Computational Efficiency of Parallel Combinatorial OR-Tree Searches

IEEE Transactions on Software Engineering
Performance analysis for parallel solutions to generic search problems

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
State of the Art in Parallel Search Techniques for Discrete Optimization Problems

IEEE Transactions on Knowledge and Data Engineering
Modeling Speedup (n) Greater than n

IEEE Transactions on Parallel and Distributed Systems
Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning

Journal of Intelligent and Robotic Systems
Partially ordered distributed computations on asynchronous point-to-point networks

Parallel Computing
Paper: Automatic test pattern generation on parallel processors

Parallel Computing
Branch-and-bound and parallel computation: A historical note

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general technique that can be used to solve a wide variety of discrete optimization problems is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms for parallel processing. The computational efficiency of these algorithms depends on the allowance function, the data structure, and the search strategies. Anomalies owing to parallelism may occur. In this correspondence, anomalies of parallel branch-and-bound algorithms using the same search strategy as the corresponding serial algorithms are studied. Sufficient conditions to guarantee no degradation in performance due to parallelism and necessary conditions for allowing parallelism to have a speedup greater than the number of processors are presented.