Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Parallel processing (Electronic computers) --- Parallelle verwerking (Computers) --- Traitement parallèle (Ordinateurs) --- Combinatorial optimization --- Data processing. --- Parallel processing (Electronic computers). --- Data processing --- Combinatorial optimization - Data processing. --- Computer network architectures. --- Computer science. --- Numerical analysis. --- Combinatorics. --- Information technology. --- Engineering. --- Computer System Implementation. --- Computation by Abstract Devices. --- Numerical Analysis. --- IT in Business. --- Complexity. --- Construction --- Industrial arts --- Technology --- IT (Information technology) --- Telematics --- Information superhighway --- Knowledge management --- Combinatorics --- Algebra --- Mathematical analysis --- Informatics --- Science --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Combinatorial optimization - Data processing