parallel combinatorial optimization (14 Ergebnisse)

8° , kart. Zustand: 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.

Zustand: Good. 1996th Edition. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. 1st Edition. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Taschenbuch. Zustand: 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.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

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

Zustand: 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.

Zustand: New. pp. xvi + 330 Illus.

Softcover. Zustand: Very Good. No Jacket. First edition. 1st 1996. Very good condition. Lecture Notes in Computer Science 1054. Grey & red cardwraps. Ex-lib with usual labels and marks. Name in ink to inside front cover. Covers scuffed. Packaged with care and promptly dispatched!

Zustand: New. EL-GHAZALI TALBI, PHD, is Professor in the Computer Science Laboratory of the University of Lille, France. His research interests include parallel algorithms for combinatorial optimization and their applications to generic and real-world problems. Dr. Talbi.

Hardcover. Zustand: Brand New. 1st edition. 330 pages. 9.50x6.50x0.75 inches. In Stock.

Zustand: New. This text provides an excellent balance of theory and application that enables you to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Editor(s): Talbi, El-Ghazali. Series: Wiley Series on Parallel and Distributed Computing. Num Pages: 330 pages, Illustrations. BIC Classification: TJ. Category: (P) Professional & Vocational. Dimension: 235 x 162 x 22. Weight in Grams: 614. . 2006. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Neuware - Learn to solve complex problems with efficient parallel optimization algorithmsThis text provides an excellent balance of theory and application that enables readers to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Collectively, the contributions serve as a complete reference to the field of combinatorial optimization, including details and findings of recent and ongoing investigations.Readers learn to solve large-scale problems quickly and efficiently with the text's clear coverage of several parallel optimization algorithms:\* Exact algorithms, including branch and bound, dynamic programming, branch and cut, semidefinite programming, and constraint programming\* Metaheuristics, including local search, tabu search, simulated annealing, scatter search, GRASP, variable neighborhood search, ant colonies, genetic programming, evolution strategies, and genetic algorithms\* Hybrid approaches, combining exact algorithms and metaheuristics\* Multi-objective optimization algorithmsThe text not only presents parallel algorithms and applications, but also software frameworks and libraries that integrate parallel algorithms for combinatorial optimization. Among the well-known parallel and distributed frameworks covered are COIN, ParadisEO, BOB++, MW, and SDPARA.Numerous real-world examples of problems and solutions demonstrate how parallel combinatorial optimization is applied in such fields as telecommunications, logistics, genomics, networking, and transportation. Whether you are a practicing engineer, field researcher, or student, this text provides you with not only the theory of parallel combinatorial optimization, but the guidance and practical tools to solve complex problems using powerful algorithms.

Paperback. Zustand: Brand New. reprint edition. 352 pages. 9.45x6.30x0.72 inches. In Stock.