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.

Springer Book Archives

Book Information
ISBN 9783540428770
Author Michael Junger
Format Paperback
Page Count 310
Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG