 |
|
|
Item Details
| Title:
|
SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL
METHODS AND TECHNIQUES |
| By: |
Alfonso Ferreira (Editor), P. Paradalos (Editor) |
| Format: |
Paperback |
| List price:
|
£62.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
354061043X |
| ISBN 13: |
9783540610434 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
27 March, 1996 |
| Series: |
Lecture Notes in Computer Science v.1054 |
| Pages: |
287 |
| Description: |
Parallel processing can reduce the runtime involved in solving combinatorial optimization problems. This work, to which contributions were made by partners of the SCOOP Project (Solving Combinatorial Optimization Problems in Parallel), examines this use of parallel processing. |
| Synopsis: |
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. |
| Illustrations: |
biography |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|