Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series)
Neumann, Frank; Witt, Carsten
ISBN 10: 3642265847 ISBN 13: 9783642265846
Published by Springer, 2013
New
Soft cover
From
Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since August 30, 2024
This specific item is no longer available.
About this Item
Description:
SUPER FAST SHIPPING. Seller Inventory # 9783642265846
Synopsis:
Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.
The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.
This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.
About the Author: Authors have given tutorials on this topic at major international conferences
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Bioinspired Computation in Combinatorial ...
Publisher: Springer
Publication Date: 2013
Binding: Soft cover
Condition: New
Top Search Results from the AbeBooks Marketplace
Seller Image
Bioinspired Computation in Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2013
ISBN 10: 3642265847
ISBN 13: 9783642265846
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors have given tutorials on this topic at major international conferencesText has been class-tested by the authors and their collaboratorsComprehensive introduction for researchers Bioinspired computing is successful in pract. Seller Inventory # 5054640
Buy New
US$ 57.90
Shipping:
US$ 56.94
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020222496
Bioinspired Computation in Combinatorial Optimization | Algorithms and Their Computational Complexity
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Bioinspired Computation in Combinatorial Optimization | Algorithms and Their Computational Complexity | Carsten Witt (u. a.) | Taschenbuch | xii | Englisch | 2013 | Springer-Verlag GmbH | EAN 9783642265846 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 106093879
Seller Image
Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
Published by
Springer Berlin Heidelberg, 2013
ISBN 10: 3642265847
ISBN 13: 9783642265846
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. Seller Inventory # 9783642265846
Seller Image
Bioinspired Computation in Combinatorial Optimization
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 2013, 2013
ISBN 10: 3642265847
ISBN 13: 9783642265846
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch. Seller Inventory # 9783642265846
Seller Image
Bioinspired Computation in Combinatorial Optimization
Published by
Springer Berlin Heidelberg Jan 2013, 2013
ISBN 10: 3642265847
ISBN 13: 9783642265846
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. 228 pp. Englisch. Seller Inventory # 9783642265846
Stock Image
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783642265846
Buy New
US$ 64.62
Shipping:
US$ 20.39
From United Kingdom to U.S.A.
Quantity: 10 available
Stock Image
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642265846_new
Buy New
US$ 66.60
Shipping:
US$ 15.77
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Bioinspired Computation in Combinatorial Optimization
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 232. Seller Inventory # 2658596274
Stock Image
Bioinspired Computation in Combinatorial Optimization
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 232. Seller Inventory # 50963565
Buy New
US$ 80.98
Shipping:
US$ 8.55
From United Kingdom to U.S.A.
Quantity: 4 available