Parallel Processing of Discrete ProblemsPanos M. Pardalos Springer Science & Business Media, 6 de des. 2012 - 243 pàgines 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. |
Continguts
Largescale structured discrete optimization | 37 |
Pushing the limits of solvable QAP problems | 59 |
On the design of parallel discrete algorithms | 75 |
Sequential and parallel branchandbound search | 139 |
A parallel grasp for the data association multidimensional | 159 |
Basic algorithms on parallel optical models of computing | 181 |
Randomized parallel algorithms | 197 |
A probabilistic study | 223 |
Altres edicions - Mostra-ho tot
Frases i termes més freqüents
applications approach architecture AROB backtracking best subpath Boolean branch and bound cells cmbP communication Computer Science constraints cost bounds defined denote depth-first search DFBB discrete domain edge efficient evaluation extrapolation formulation genetic algorithms global optimization graph grid IEEE implementation initial input interval graphs iteration LEMMA linear load balancing local search lower bound Mathematics matrix maximum memory mesh minimizer minimum N₁ neurons number of nodes number of processors objective function OCPC optimal solution optimization problems OTIS-Mesh packets parallel algorithms Parallel and Distributed parallel Branch-and-Bound parallel computing parallel processing Pardalos partition performance permutation phase polynomial prefix sums prob Proc procedure quadratic assignment problem randomized rithm SAT algorithms SAT problem satisfiability search algorithm search space sensor sequential simulated annealing solving speedup structure subproblem target techniques tion variables vertex weighted graphs