Coping with Anomalies in Parallel Branch-and-Bound Algorithms

Author

Li, Guo-Jie ; Wah, Benjamin W.

Author_Institution

School of Electrical Engineering, Purdue University, West Lafayette, IN.; Coordinated Science Laboratory and the Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL 61801.

Issue

6

fYear

1986

fDate

6/1/1986 12:00:00 AM

Firstpage

568

Lastpage

573

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.

Keywords

Algorithm design and analysis; Design methodology; Dynamic programming; Parallel algorithms; Parallel processing; Partitioning algorithms; Polynomials; Prediction algorithms; Process design; Search problems; Anomalies; approximation; branch-and-bound algorithms; heuristic search; lower-bound test; parallel processing;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.1986.5009434

Filename

5009434