• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Solving Combinatorial Optimization Problems in Parallel Methods and Techniques: Methods and Techniques

Solving Combinatorial Optimization Problems in Parallel Methods and Techniques: Methods and Techniques

Paperback

Series: Lecture Notes in Computer Science, Book 1054

General ComputersGeneral Mathematics

ISBN10: 354061043X
ISBN13: 9783540610434
Publisher: Springer
Published: Mar 27 1996
Pages: 280
Weight: 0.91
Height: 0.61 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics