Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

By Frank Neumann , Carsten Witt

Bioinspired Computation in Combinatorial Optimization Cover Image

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.

Full Description

  • ISBN13: 978-3-6421-6543-6
  • 228 Pages
  • User Level: Science
  • Publication Date: November 4, 2010
  • Available eBook Formats: PDF
  • eBook Price: $99.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
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.
Table of Contents

Table of Contents

  1. Introduction.
  2. Combinatorial Optimization and Computational Complexity.
  3. Stochastic Search Algorithms.
  4. Analyzing Stochastic Search Algorithms.
  5. Minimum Spanning Trees.
  6. Maximum Matchings.
  7. Makespan Scheduling.
  8. Shortest Paths.
  9. Eulerian Cycles.
  10. Multi
  11. objective Minimum Spanning Trees.
  12. Minimum Spanning Trees Made Easier.
  13. Covering Problems.
  14. Cutting Problems.
  15. App. A.1, Probability Distributions.
  16. App. A.2, Deviation Inequalities.
  17. App. A.3, Other Useful Formulas.
  18. References.
Errata

Please Login to submit errata.

No errata are currently published