This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Series: Natural Computing Series. Num Pages: 228 pages, biography. BIC Classification: PBU; UMB; UYQ. Category: (P) Professional & Vocational. Dimension: 181 x 258 x 16. Weight in Grams: 530. . 2010. 2010th Edition. Hardcover. . . . . Books ship from the US and Ireland.

Seller Inventory # V9783642165436

Contact seller

Report this item

Bibliographic Details

Title: Bioinspired Computation in Combinatorial Optimization
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Publication Date: 2010
Language: English
ISBN 10: 3642165435
ISBN 13: 9783642165436
Binding: Hardcover
Condition: New

About this title

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.

Store Description

We carry a comprehensive range of out of print and rare books.

Visit Seller's Storefront

Seller's business information

Kennys Bookshops and Art Galleries Limited
Liosban Industrial Estate, Tuam Road, Galway, GY, Ireland

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the Abebooks websites.

If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date.

For any queries please use the contact seller link or send an email to books@kennys.ie

Conor Kenny

Right of cancellation

Shipping Terms

All books securely packaged. Some books ship from Ireland.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	14 to 20 business days	13 to 14 business days
First item	� 7.84	� 15.67

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.