Computational combinatorial optimization(计算组合优化：优化或可证实近优化方案)|报价￥93.50|图书,进口原版,Computers & Internet 计算机与互联网,Programming 程序设计,Michael Jünger (Editor)
品牌：Michael Jünger (Editor)
基本信息
·出版社：Springer; 1 edition
·页码：314 页码
·出版日：2001年
·ISBN：9783540428770
·条码：9783540428770
·版次：1
·装帧：平装
·开本：16开 16开
内容简介
在线阅读本书
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
点此购买报价￥93.50
