Computational Combinatorial Optimization

运筹学

原   价:
553.00
售   价:
442.00
优惠
平台大促 低至8折优惠
作      者
出  版 社
出版时间
2001年11月15日
装      帧
平装
ISBN
9783540428770
复制
页      码
310
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 73 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个