| || || || || || || |
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1995; 374 pp; hardcover
List Price: US$108
Member Price: US$86.40
Order Code: DIMACS/22
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.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).
Graduate students and researchers in computer science, mathematics, engineering, and operations research.
Table of Contents
AMS Home |
© Copyright 2012, American Mathematical Society