Lecture Notes in Computer Science: Methods and Techniques

Ferreira, Alfonso; Pardalos, Panos

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.

Details

Published by: Springer

Publication Date: 1996-03-27

Format: Paperback

ISBN-13: 9783540610434

DOI: 10.1007/BFb0027114

Dimensions: 235cm x155cm

Pages: 280