Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Parallel Processing of Discrete Optimization Problems
 
Edited by: Panos M. Pardalos :  University of Florida, Gainesville, FL
Mauricio G. C. Resende :  American Tel & Tel Bell Laboratories, Murray Hill, NJ
K. G. Ramakrishnan :  American Tel & Tel Bell Laboratories, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Parallel Processing of Discrete Optimization Problems
Hardcover ISBN:  978-0-8218-0240-3
Product Code:  DIMACS/22
List Price: $128.00
MAA Member Price: $115.20
AMS Member Price: $102.40
eBook ISBN:  978-1-4704-3980-4
Product Code:  DIMACS/22.E
List Price: $120.00
MAA Member Price: $108.00
AMS Member Price: $96.00
Hardcover ISBN:  978-0-8218-0240-3
eBook: ISBN:  978-1-4704-3980-4
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
Add to cart
Parallel Processing of Discrete Optimization Problems
Click above image for expanded view
Parallel Processing of Discrete Optimization Problems
Edited by: Panos M. Pardalos :  University of Florida, Gainesville, FL
Mauricio G. C. Resende :  American Tel & Tel Bell Laboratories, Murray Hill, NJ
K. G. Ramakrishnan :  American Tel & Tel Bell Laboratories, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-0240-3
Product Code:  DIMACS/22
List Price: $128.00
MAA Member Price: $115.20
AMS Member Price: $102.40
eBook ISBN:  978-1-4704-3980-4
Product Code:  DIMACS/22.E
List Price: $120.00
MAA Member Price: $108.00
AMS Member Price: $96.00
Hardcover ISBN:  978-0-8218-0240-3
eBook ISBN:  978-1-4704-3980-4
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
Add to cart
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 22; 1995; 374 pp
    MSC: 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.

    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).
    Readership

    Graduate 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 branch-and-bound 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 depth-first 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
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 22; 1995; 374 pp
MSC: 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.

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).
Readership

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 branch-and-bound 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 depth-first 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
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Powered by MathJax
Please select which format for which you are requesting permissions.