AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution

Parallel Processing of Discrete Optimization Problems

About this Title

Panos Pardalos, University of Florida, Gainesville, FL, Mauricio G Resende, American Tel & Tel Bell Laboratories, Murray Hill, NJ and K. G. Ramakrishnan, American Tel & Tel Bell Laboratories, Murray Hill, NJ, Editors

Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year: 1995; Volume 22
ISBNs: 978-0-8218-0240-3 (print); 978-1-4704-3980-4 (online)
DOI: https://doi.org/10.1090/dimacs/022
MathSciNet review: MR1359562
MSC: Primary 68-06; Secondary 90-06

Read more about this volume

Table of Contents

Front/Back Matter

• View this volume's front and back matter

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

View full volume PDF