ENGLISH

Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1996
ISBN
354061043X, 9783540610434
DOI
10.1007/BFb0027114
LCC
QA402.5 .S65 1996
Open Library ID
OL9061797M
Language
english
Format
DJVU
Filesize
2 MB (2229280 bytes)
Series
Lecture Notes in Computer Science 1054
Edition
1
Pages
280\281
Library
Kolxo3
DPI
300
Time added
2009-12-04 00:34:26

Description

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.

Similar books