Solving Combinatorial Optimization Problems Parallel by Ferreira Alfonso Panos Pardalos (11 results)

8° , kart. Condition: Sehr gut. 274 S. : graph. Darst. ; 24 cm Ausgetragenes Bibliotheksexemplar, Buch ist in einem sehr guten Zustand, Ecken minimal berieben, Papier in sehr gutem Zustand, RFID-Chip im Nachsatz. B05-02-05D Sprache: Englisch Gewicht in Gramm: 411.

Condition: New. In.

Soft cover. Condition: As New. Dust Jacket Condition: As New. Unread and unmarked.

paperback. Condition: New. In shrink wrap. Looks like an interesting title!

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Taschenbuch. Condition: Neu. Solving Combinatorial Optimization Problems in Parallel Methods and Techniques | Methods and Techniques | Alfonso Ferreira (u. a.) | Taschenbuch | vii | Englisch | 1996 | Springer | EAN 9783540610434 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Softcover. Condition: Gut. 274 Computerwissenschaft kombinatorische Optimierungsprobleme Guter Zustand/ Good With figures. Ex-Library.Einband mit Gebrauchsspuren. ha1060028 Sprache: Englisch Gewicht in Gramm: 450.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 292 | Sprache: Englisch | Produktart: Bücher | 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.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 292 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 292 pp. Englisch.