Parallel processing of discrete optimization problems : DIMACS workshop, April 28-29, 1994
Author(s)
Bibliographic Information
Parallel processing of discrete optimization problems : DIMACS workshop, April 28-29, 1994
（DIMACS series in discrete mathematics and theoretical computer science, v. 22）
American Mathematical Society, 1995
Available at / 19 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Piscata||way||1994.495031289
-
No Libraries matched.
- Remove all filters.
Note
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT&T Bell Labs, Bellcore."
Includes bibliographical references
Description and Table of Contents
Description
This book contains papers presented at the Workshop on Parallel Processing of Discrete Optimization Problems held at DIMACS in April 1994. The contents cover a wide spectrum of the most recent algorithms and applications in parallel processing of discrete optimization and related problems. Topics include parallel branch and bound algorithms, scalability, load balancing, parallelism and irregular data structures and scheduling task graphs on parallel machines. Applications include parallel algorithms for solving satisfiability problems, location problems, linear programming, quadratic and linear assignment problems. This book would be suitable as a textbook in advanced courses on parallel algorithms and combinatorial optimization.
Table of Contents
Proving correctness for balancing networks by C. Busch and M. Mavronicolas A note on parallel randomized algorithms for searching problems by A. Clementi, J. Rolim, and L. Kucera Modeling parallel branch-and-bound for asynchronous implementations by R. Correa and A. Ferreira A data parallel space dilation algorithm for the concentrator location problem by O. Damberg and A. Migdalas A multistage approach for scheduling task graphs on parallel machines by A. Gerasoulis, J. Jiao, and T. Yang Parallel algorithms for satisfiability (SAT) problem by J. Gu Experiences with a parallel formulation of an interior point algorithm by G. Karypis, A. Gupta, and V. Kumar Experiences with a synchronous parallel branch and bound algorithm by P. S. Laursen New anticipatory load balancing strategies for parallel $A^\ast$ algorithms by N. R. Mahapatra and S. Dutt A parallel algorithm for computing all homomorphisms of deterministic finite automata by B. Mikolajczak Query optimization and processing in parallel databases by T. M. Niccum, J. Srivastava, B. Himatsingka, and J. Li Scheduling acyclic task graphs on distributed memory parallel architectures by S. Pande and K. Psarris Scalability of massively parallel depth-first search by A. Reinefeld On irregular data structures and asynchronous parallel branch and bound algorithms by C. Roucairol Parallel algorithms for the assignment problem--An experimental evaluation of three distributed algorithms by C. Schutt and J. Clausen Serial & parallel algorithms for QSP problems by J. M. Smith and K. Xu.
by "Nielsen BookData"
