Author: Alfonso Ferreira
Publisher: Boom Koninklijke Uitgevers
Published: 1996-03-27
Total Pages: 292
ISBN-13: 9783540610434
DOWNLOAD EBOOKSolving 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.
Book Synopsis Solving Combinatorial Optimization Problems in Parallel by : Alfonso Ferreira
Download or read book Solving Combinatorial Optimization Problems in Parallel written by Alfonso Ferreira and published by Boom Koninklijke Uitgevers. This book was released on 1996-03-27 with total page 292 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.