| 商家名称 | 信用等级 | 购买信息 | 订购本书 |
 |
 |
Combinatorial Optimization: Algorithms and Complexity |  |
 |
|
Combinatorial Optimization: Algorithms and Complexity | |
出版日期: 2000年2月1日
Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." -- "American Mathematical Monthly." 1982 edition..
喜欢Combinatorial Optimization: Algorithms and Complexity请与您的朋友分享,由于版权原因，读书人网不提供图书下载服务
