Computational Combinatorial Optimization
Download Computational Combinatorial Optimization PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Computational Combinatorial Optimization book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Bioinspired Computation in Combinatorial Optimization
Author: Frank Neumann
language: en
Publisher: Springer Science & Business Media
Release Date: 2010-11-04
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.
Handbook of combinatorial optimization
Author: Dingzhu Du
language: en
Publisher: Springer Science & Business Media
Release Date: 1998-12-15
This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.
Combinatorial Optimization
Author: Alexander Schrijver
language: en
Publisher: Springer Science & Business Media
Release Date: 2003-02-12
This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.