- Main
- Mathematics - Optimization. Operations Research
- Combinatorial Optimization: Algorithms...
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou, Kenneth Steiglitz你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.
卷:
1
年:
1998
出版:
2
出版社:
Prentice Hall
语言:
english
页:
528
ISBN 10:
0486402584
ISBN 13:
9780486402581
系列:
Mathematical optimization
文件:
PDF, 31.35 MB
您的标签:
IPFS:
CID , CID Blake2b
english, 1998
在1-5分钟内,文件将被发送到您的电子邮件。
该文件将通过电报信使发送给您。 您最多可能需要 1-5 分钟才能收到它。
注意:确保您已将您的帐户链接到 Z-Library Telegram 机器人。
该文件将发送到您的 Kindle 帐户。 您最多可能需要 1-5 分钟才能收到它。
请注意:您需要验证要发送到Kindle的每本书。检查您的邮箱中是否有来自亚马逊Kindle的验证电子邮件。
正在转换
转换为 失败