分享给好友:
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou New edition
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou
This 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; local search heuristics for NP-complete problems, more. 1982 edition.
528 pages
| 介质类型 | 图书 Paperback Book (平装胶订图书) |
| 已发行 | 2000年2月1日 |
| ISBN13 | 9780486402581 |
| 出版商 | Dover Publications Inc. |
| 页数 | 528 |
| 商品尺寸 | 136 × 214 × 26 mm · 644 g |