Cantitate/Preț
Produs

Solving Combinatorial Optimization Problems in Parallel Methods and Techniques: Methods and Techniques: Lecture Notes in Computer Science, cartea 1054

Editat de Alfonso Ferreira, Panos Pardalos
en Limba Engleză Paperback – 27 mar 1996
Solving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can reduce the runtime from days or months, typical when one workstation is used, to a few minutes or even seconds.
Partners of the CEC-sponsored SCOOP Project (Solving Combinatorial Optimization Problems in Parallel) contributed, on invitation, to this book; much attention was paid to competent coverage of the topic and the style of writing. Readers will include students, scientists, engineers, and professionals interested in the design and implementation of parallel algorithms for solving combinatorial optimization problems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33224 lei

Preț vechi: 41530 lei
-20% Nou

Puncte Express: 498

Preț estimativ în valută:
6358 6598$ 5314£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540610434
ISBN-10: 354061043X
Pagini: 292
Ilustrații: VII, 280 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

SCOOP: Solving Combinatorial Optimization problems in parallel.- Parallel approximation of optimization problems.- Randomized parallel algorithms.- Automatic synthesis of parallel algorithms.- An introduction to parallel dynamic programming.- Mapping tree-structured combinatorial optimization problems onto parallel computers.- Towards an abstract parallel branch and bound machine.- Parallel best-first branch- and-bound in discrete optimization: A framework.- Building a parallel branch and bound library.- Parallel algorithms for global optimization problems.- Parallel heuristic search — Introductions and a new approach.