Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solut

商家名称	信用等级	购买信息	订购本书
		Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solut
		Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solut

基本信息·出版社：Springer; 1 edition
·页码：314 页
·出版日期：2001年12月
·ISBN：3540428771
·条形码：9783540428770
·版本：1
·装帧：平装
·开本：16开 Pages Per Sheet
·丛书名：Lecture Notes in Computer Science
·外文书名：计算组合优化: 优化或可证实近优化方案

内容简介 在线阅读本书

Book Description
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.

Book Dimension
length: (cm)23.3 　　　 　　　　　 　　　　　 width:(cm)15.4

查看更多 下一篇