Parallel Processing of Discrete Problems, v. 106 (Hardcover, New)


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.

R2,565

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles25650
Mobicred@R240pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 12 - 17 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer-Verlag New York

Country of origin

United States

Series

The IMA Volumes in Mathematics and its Applications, v. 106

Release date

November 1998

Availability

Expected to ship within 12 - 17 working days

First published

November 1998

Editors

Dimensions

241 x 165mm (L x W)

Format

Hardcover

Pages

244

Edition

New

ISBN-13

978-0-387-98664-7

Barcode

9780387986647

Categories

LSN

0-387-98664-2



Trending On Loot