Computational combinatorial optimization / Michael Junger, Denis Naddef (eds.)
- 其他作者：
- 其他題名：
- Springer e-books
- 出版： Berlin ;New York : Springer c2001
- 叢書名： Lecture notes in computer science ; ;2241
- 主題： Programming (Mathematics)--Congresses. , Combinatorial optimization--Congresses.
- ISBN： 9783540428770 (paper)
- URL：
電子書
-
讀者標籤：
- 系統號： 005167896 | 機讀編目格式
館藏資訊
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.