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.
Computational Combinatorial Optimization
Author: Michael Jünger
language: en
Publisher: Springer Science & Business Media
Release Date: 2001-11-21
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
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.