Parallel Processing of Discrete Problems (Paperback, Softcover reprint of the original 1st ed. 1999)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	The IMA Volumes in Mathematics and its Applications, 106
Release date:	March 2013
First published:	1999
Editors:	Panos M. Pardalos
Dimensions:	235 x 155 x 13mm (L x W x T)
Format:	Paperback
Pages:	243
Edition:	Softcover reprint of the original 1st ed. 1999
ISBN-13:	978-1-4612-7165-9
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Business & Economics > Business & management > Management & management techniques > Operational research Promotions
LSN:	1-4612-7165-7
Barcode:	9781461271659

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!