## A Survey of Parallel Search Algorithms for Discrete Optimization Problems (1993)

Venue: | ORSA JOURNAL ON COMPUTING |

Citations: | 7 - 0 self |

### BibTeX

@ARTICLE{Grama93asurvey,

author = {Ananth Y. Grama and Vipin Kumar},

title = {A Survey of Parallel Search Algorithms for Discrete Optimization Problems},

journal = {ORSA JOURNAL ON COMPUTING},

year = {1993},

volume = {7}

}

### OpenURL

### Abstract

Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is formulated in terms of finding a (minimum cost) solution path in a graph from an initial node to a goal node and solved by graph/tree search methods. Availability of parallel computers has created substantial interest in exploring parallel formulations of these graph and tree search methods. This article provides a survey of various parallel search algorithms such as Backtracking, IDA*, A*, Branch-and-Bound techniques and Dynamic Programming. It addresses issues related to load balancing, communication costs, scalability and the phenomenon of speedup anomalies in parallel search.