Hardcover ISBN:  9780821802403 
Product Code:  DIMACS/22 
List Price:  $128.00 
MAA Member Price:  $115.20 
AMS Member Price:  $102.40 
eBook ISBN:  9781470439804 
Product Code:  DIMACS/22.E 
List Price:  $120.00 
MAA Member Price:  $108.00 
AMS Member Price:  $96.00 
Hardcover ISBN:  9780821802403 
eBook: ISBN:  9781470439804 
Product Code:  DIMACS/22.B 
List Price:  $248.00 $188.00 
MAA Member Price:  $223.20 $169.20 
AMS Member Price:  $198.40 $150.40 
Hardcover ISBN:  9780821802403 
Product Code:  DIMACS/22 
List Price:  $128.00 
MAA Member Price:  $115.20 
AMS Member Price:  $102.40 
eBook ISBN:  9781470439804 
Product Code:  DIMACS/22.E 
List Price:  $120.00 
MAA Member Price:  $108.00 
AMS Member Price:  $96.00 
Hardcover ISBN:  9780821802403 
eBook ISBN:  9781470439804 
Product Code:  DIMACS/22.B 
List Price:  $248.00 $188.00 
MAA Member Price:  $223.20 $169.20 
AMS Member Price:  $198.40 $150.40 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 22; 1995; 374 ppMSC: Primary 68; 90
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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipGraduate students and researchers in computer science, mathematics, engineering, and operations research.

Table of Contents

Chapters

Proving correctness for balancing networks

A note on parallel randomized algorithms for searching problems

Modeling parallel branchandbound for asynchronous implementations

A data parallel space dilation algorithm for the concentrator location problem

A multistage approach for scheduling task graphs on parallel machines

Parallel algorithms for satisfiability (SAT) problem

Experiences with a parallel formulation of an interior point algorithm

Experiences with a synchronous parallel branch and bound algorithm

New anticipatory load balancing strategies for parallel A* algorithms

A parallel algorithm for computing all homomorphisms of deterministic finite automata

Query optimization and processing in parallel databases

Scheduling acyclic task graphs on distributed memory parallel architectures

Scalability of massively parallel depthfirst search

On irregular data structures and asynchronous parallel branch and bound algorithms

Parallel algorithms for the assignment problem–An experimental evaluation of three distributed algorithms

Serial & parallel algorithms for QSP problems


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
Graduate students and researchers in computer science, mathematics, engineering, and operations research.

Chapters

Proving correctness for balancing networks

A note on parallel randomized algorithms for searching problems

Modeling parallel branchandbound for asynchronous implementations

A data parallel space dilation algorithm for the concentrator location problem

A multistage approach for scheduling task graphs on parallel machines

Parallel algorithms for satisfiability (SAT) problem

Experiences with a parallel formulation of an interior point algorithm

Experiences with a synchronous parallel branch and bound algorithm

New anticipatory load balancing strategies for parallel A* algorithms

A parallel algorithm for computing all homomorphisms of deterministic finite automata

Query optimization and processing in parallel databases

Scheduling acyclic task graphs on distributed memory parallel architectures

Scalability of massively parallel depthfirst search

On irregular data structures and asynchronous parallel branch and bound algorithms

Parallel algorithms for the assignment problem–An experimental evaluation of three distributed algorithms

Serial & parallel algorithms for QSP problems