DIMACS TR: 93-38
Parallel Processing of Discrete Optimization Problems
Authors: Grama Y. Ananth, Vipin Kumar, and Panos Pardalos
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 such as branch-and-bound
and dynamic programming. Availability of parallel computers has created
substantial interest in exploring the use of parallel processing for solving
discrete optimization problems. This article provides an overview of
parallel search algorithms for solving discrete optimization problems.
Paper available at:
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1993/93-38.ps
DIMACS Home Page