Parallel Processing of Discrete Problems.

Panos M Pardalos

ISBN 10: 0387986642 / ISBN 13: 9780387986647

Published by New York, NY, U.S.A. Springer Verlag, 1998

About this Item

Gebraucht - Sehr gut Zustand: Sehr gut, Mängelexemplar, IX, 235 p. 63 illus. About this book 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. Written for researchers, graduate students.

Seller Inventory # 18070

Bibliographic Details

• Title: Parallel Processing of Discrete Problems.
• Publisher: New York, NY, U.S.A. Springer Verlag
• Publication Date: 1998
• Language: English
• ISBN 10: 0387986642
• ISBN 13: 9780387986647
• Binding: Gebunden
• Condition: Sehr gut

About this title

Synopsis

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.