个人学习好书推荐与知识分享
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》Christos H. Papadimitriou 【benniaobook.org】.pdf
密码:2024 感谢您喜欢博主推荐此书,请支持购买正版。
发表回复
要发表评论,您必须先登录。