Bioinspired Computation in Combinatorial Optimization

Neumann, Frank; Witt, Carsten

ISBN 10: 3642165435 ISBN 13: 9783642165436
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2010
New Hardcover

From Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since 27 February 2001

This specific item is no longer available.

About this Item

Description:

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. . . . . Seller Inventory # V9783642165436

Report this item

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-Verlag Berlin and Heidelberg GmbH & Co. KG
Publication Date: 2010
Binding: Hardcover
Condition: New

Top Search Results from the AbeBooks Marketplace

Seller Image

Frank Neumann|Carsten Witt
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Gebunden. 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 # 5051184

Contact seller

Buy New

£ 43.31
Convert currency
Shipping: £ 42.59
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Neumann, Frank; Witt, Carsten
Published by Springer, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar3113020219843

Contact seller

Buy New

£ 45.80
Convert currency
Shipping: £ 3
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Neumann, Frank; Witt, Carsten
Published by Springer, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: GreatBookPrices, Columbia, MD, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 11967773-n

Contact seller

Buy New

£ 46.81
Convert currency
Shipping: £ 1.98
Within U.S.A.
Destination, rates & speeds

Quantity: 15 available

Add to basket

Seller Image

Carsten Witt
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. 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 # 9783642165436

Contact seller

Buy New

£ 47.90
Convert currency
Shipping: £ 54.57
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Carsten Witt
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. 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 # 9783642165436

Contact seller

Buy New

£ 47.90
Convert currency
Shipping: £ 52.16
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Carsten Witt
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. 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 # 9783642165436

Contact seller

Buy New

£ 47.90
Convert currency
Shipping: £ 20
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Frank Neumann
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783642165436

Contact seller

Buy New

£ 48.84
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Neumann, Frank
Published by Springer 11/5/2010, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: BargainBookStores, Grand Rapids, MI, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Hardback or Cased Book. Condition: New. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Book. Seller Inventory # BBS-9783642165436

Contact seller

Buy New

£ 49.10
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 5 available

Add to basket

Stock Image

Neumann, Frank; Witt, Carsten
Published by Springer, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9783642165436_new

Contact seller

Buy New

£ 49.13
Convert currency
Shipping: £ 11.98
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Neumann, Frank/ Witt, Carsten
Published by Springer-Verlag New York Inc, 2010
ISBN 10: 3642165435 ISBN 13: 9783642165436
New Hardcover

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Brand New. 216 pages. 9.00x6.00x0.75 inches. In Stock. Seller Inventory # x-3642165435

Contact seller

Buy New

£ 65.21
Convert currency
Shipping: £ 25
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

There are 6 more copies of this book

View all search results for this book