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.
€56.99
购买此电子书可免费获赠一本！
语言 英语 ● 格式 PDF ● ISBN 9783540455868 ● 编辑 Michael Junger & Denis Naddef ● 出版者 Springer Berlin Heidelberg ● 发布时间 2001 ● 下载 3 时 ● 货币 EUR ● ID 6357041 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器
来自同一作者的更多电子书 / 编辑
48,216 此类电子书
