Solving Combinatorial Optimization Problems in Parallel Methods and Techniques: Methods and Techniques -
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
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. ... Full description
You May Also Like
TOP
The Demon-Haunted World: Science as a Candle in the Dark
-20% with code BOOKS
In stock at our supplier
TOP
Many Faces, One Purpose: A Managers Handbook on Women in Firefighting
U. S. Fire Administration, Homeland Security
-20% with code BOOKS
Out of stock
TOP
The Gulf Moment: Arab Relations Since 2011
Florence Gaub, U. S. Army War College, Strategic Studies Institute
-20% with code BOOKS
Out of stock
TOP
Medizinisches Englisch pocket
-20% with code BOOKS
In stock at our supplier
TOP
How Africa Works: Success and Failure on the World's Last Developmental Frontier
-20% with code BOOKS
In stock at our supplier
TOP
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Algorithms
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
-20% with code BOOKS
In stock at our supplier
TOP
The Unaccountability Machine: Why Big Systems Make Terrible Decisions
-20% with code BOOKS
In stock at our supplier
TOP
Skin in the Game: Hidden Asymmetries in Daily Life
-20% with code BOOKS
In stock at our supplier
TOP
Dinosaurs and Prehistoric Life: The Definitive Visual Guide to Prehistoric Animals
-20% with code BOOKS
In stock at our supplier
TOP
Thinking in Systems: International Bestseller
-20% with code BOOKS
In stock at our supplier
TOP
Crossing Borders: About the birth of the Consortium of European Research Libraries, the organisation's early years and its path to maturity, spanning the period from the late twentieth century to the first decades of the twenty-first century
-20% with code BOOKS
In stock at our supplier
TOP
Cybernetics: Second Edition: Or the Control and Communication in the Animal and the Machine
-20% with code BOOKS
In stock at our supplier
TOP
Empty Vessel: The Story of the Global Economy in One Barge
-20% with code BOOKS
In stock at our supplier
TOP
101 Things I Learned in Architecture School
-20% with code BOOKS
In stock at our supplier
TOP
Einhundert Zitate Female Edition: Ein Postkartenbuch mit 100 Zitaten
-20% with code BOOKS
In stock at our supplier
TOP
Only Dull People Are Brilliant at Breakfast
-20% with code BOOKS
In stock at our supplier
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.
More Information
| Publisher | Springer Berlin Heidelberg |
|---|---|
| Series | Lecture Notes in Computer Science |
| Release year | 1996 |
| Cover type | Softcover |
| EAN | 9783540610434 |