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.
| ISBN: | 9783540610434 |
| Publication date: | 27th March 1996 |
| Author: | Alfonso Ferreira, Panos Pardalos |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 280 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Systems analysis and design Cybernetics and systems theory Numerical analysis Maths for engineers Business mathematics and systems Discrete mathematics Mathematical theory of computation Business applications |
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.
Solving Combinatorial Optimization Problems in Parallel features in the following genres: Systems analysis and design, Cybernetics and systems theory, Numerical analysis, Maths for engineers, Business mathematics and systems, Discrete mathematics, Mathematical theory of computation, Business applications
Paperback. Not Available.
Solving Combinatorial Optimization Problems in Parallel was written by Alfonso Ferreira, Panos Pardalos and published by Springer an imprint of Springer Berlin Heidelberg
Solving Combinatorial Optimization Problems in Parallel has 280 pages
Yes it is part of Lecture Notes in Computer Science series