Identifiant pérenne de la notice : 206749163
Notice de type
Notice de regroupement
Note publique d'information : 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.
paprika.idref.fr
data.idref.fr
Documentation
