Solving combinatorial optimization problems (29 résultats)

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

Paperback. Etat : Near Fine. Etat de la jaquette : Good. May not match image shown. The book has a shallow dent at the top edge of the front cover and a former owner's stamp on the front endpage in faded black ink, otherwise the book is in excellent, like new condition with crisp, unmarked pages, a tight binding, and a strong, clean cover. The dustjacket has significant rubbing and surface scratching to both covers most notable at the back cover, smudging to the back cover, and very minor shelfwear to the edges and corners of the jacket, otherwise the dustjacket is in good condition, intact and attractive.…

Etat : New.

Etat : New.

Soft cover. Etat : As New. Etat de la jaquette : As New. Unread and unmarked.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : New. In shrink wrap. Looks like an interesting title.

Paperback. Etat : Brand New. 196 pages. 8.66x5.91x0.45 inches. In Stock.

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

Taschenbuch. Etat : 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. Etat : Neu. Combinatorial Optimization Problems | Modeling and Solving | Faez Hassan Ali (u. a.) | Taschenbuch | 196 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659936852 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.…

Etat : New.

Etat : new.

Etat : As New. Unread book in perfect condition.

Etat : New.

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

Etat : 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.…

Etat : As New. Unread book in perfect condition.

Etat : New.

Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days.

Etat : New. In English.

Paperback. Etat : Brand New. 387 pages. 9.25x6.00x1.00 inches. In Stock.

Softcover. Etat : 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.

Taschenbuch. Etat : 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.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In mathematics and computer science, an optimization problem (OP) is the problem of finding the best solution from all feasible solutions. OP's can be divided into two categories depending on whether the variables are continuous or discrete. An OP with discrete variables is known as a combinatorial optimization problem (COP). Over the last few years, the use of COP's has increased exponentially in many fields, marketing, industrial, security communications and aircraft problems. The aim of the research presented in this book is to investigate the use of various optimization exacts and heuristics to solve the COP's. In this book we interest in discussing three samples of COP's; machine scheduling problem (MSP), transposition cipher problem (TCP) and aircraft landing problem (ALP). For these study cases, we first discuss the mathematical modeling (single and multi-objective functions and the constraints) then different solving methods, like exact (Branch and Bound), heuristics, local search methods (Genetic Algorithm, Particle Swarm Optimization and BA) and using Neural Networks. In this book we solve some practical examples obtained from some famous sits.…

Etat : 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. Etat : 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.…

Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 633.

Paperback. Etat : Brand New. 387 pages. 9.25x6.00x1.00 inches. In Stock. This item is printed on demand.