![cover of the book Parallel Processing of Discrete Problems](/covers/files_200/978000/962e4a5aeff142a8a935f51f1f1a7bfd-d.jpg)
Ebook: Parallel Processing of Discrete Problems
- Tags: Combinatorics, Operation Research/Decision Theory
- Series: The IMA Volumes in Mathematics and its Applications 106
- Year: 1999
- Publisher: Springer-Verlag New York
- Edition: 1
- Language: English
- pdf
In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete and global optimization problems. The chapters in this volume cover a broad spectrum of recent research in parallel processing of discrete and related problems. The topics discussed include distributed branch-and-bound algorithms, parallel genetic algorithms for large scale discrete problems, simulated annealing, parallel branch-and-bound search under limited-memory constraints, parallelization of greedy randomized adaptive search procedures, parallel optical models of computing, randomized parallel algorithms, general techniques for the design of parallel discrete algorithms, parallel algorithms for the solution of quadratic assignment and satisfiability problems. The book will be a valuable source of information to faculty, students and researchers in combinatorial optimization and related areas.
In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete and global optimization problems. The chapters in this volume cover a broad spectrum of recent research in parallel processing of discrete and related problems. The topics discussed include distributed branch-and-bound algorithms, parallel genetic algorithms for large scale discrete problems, simulated annealing, parallel branch-and-bound search under limited-memory constraints, parallelization of greedy randomized adaptive search procedures, parallel optical models of computing, randomized parallel algorithms, general techniques for the design of parallel discrete algorithms, parallel algorithms for the solution of quadratic assignment and satisfiability problems. The book will be a valuable source of information to faculty, students and researchers in combinatorial optimization and related areas.
In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete and global optimization problems. The chapters in this volume cover a broad spectrum of recent research in parallel processing of discrete and related problems. The topics discussed include distributed branch-and-bound algorithms, parallel genetic algorithms for large scale discrete problems, simulated annealing, parallel branch-and-bound search under limited-memory constraints, parallelization of greedy randomized adaptive search procedures, parallel optical models of computing, randomized parallel algorithms, general techniques for the design of parallel discrete algorithms, parallel algorithms for the solution of quadratic assignment and satisfiability problems. The book will be a valuable source of information to faculty, students and researchers in combinatorial optimization and related areas.
Content:
Front Matter....Pages i-ix
Distributed Branch and Bound Algorithms for Global Optimization....Pages 1-35
Large-Scale Structured Discrete Optimization via Parallel Genetic Algorithms....Pages 37-57
Pushing the Limits of Solvable QAP Problems Using Parallel Processing - Is Nugent30 within Reach?....Pages 59-74
On the Design of Parallel Discrete Algorithms for High Performance Computing Systems....Pages 75-83
Parallel Algorithms for Satisfiability (SAT) Testing....Pages 85-138
Sequential and Parallel Branch-and-Bound Search under Limited-Memory Constraints....Pages 139-158
A Parallel Grasp for the Data Association Multidimensional Assignment Problem....Pages 159-179
Basic Algorithms on Parallel Optical Models of Computing....Pages 181-195
Randomized Parallel Algorithms....Pages 197-222
Finite Behavior of Simulated Annealing: A Probabilistic Study....Pages 223-235
Back Matter....Pages 237-242
In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving discrete and global optimization problems. The chapters in this volume cover a broad spectrum of recent research in parallel processing of discrete and related problems. The topics discussed include distributed branch-and-bound algorithms, parallel genetic algorithms for large scale discrete problems, simulated annealing, parallel branch-and-bound search under limited-memory constraints, parallelization of greedy randomized adaptive search procedures, parallel optical models of computing, randomized parallel algorithms, general techniques for the design of parallel discrete algorithms, parallel algorithms for the solution of quadratic assignment and satisfiability problems. The book will be a valuable source of information to faculty, students and researchers in combinatorial optimization and related areas.
Content:
Front Matter....Pages i-ix
Distributed Branch and Bound Algorithms for Global Optimization....Pages 1-35
Large-Scale Structured Discrete Optimization via Parallel Genetic Algorithms....Pages 37-57
Pushing the Limits of Solvable QAP Problems Using Parallel Processing - Is Nugent30 within Reach?....Pages 59-74
On the Design of Parallel Discrete Algorithms for High Performance Computing Systems....Pages 75-83
Parallel Algorithms for Satisfiability (SAT) Testing....Pages 85-138
Sequential and Parallel Branch-and-Bound Search under Limited-Memory Constraints....Pages 139-158
A Parallel Grasp for the Data Association Multidimensional Assignment Problem....Pages 159-179
Basic Algorithms on Parallel Optical Models of Computing....Pages 181-195
Randomized Parallel Algorithms....Pages 197-222
Finite Behavior of Simulated Annealing: A Probabilistic Study....Pages 223-235
Back Matter....Pages 237-242
....