Combinatorial Optimization: Algorithms and Complexity

Main
Mathematics - Optimization. Operations Research
Combinatorial Optimization: Algorithms...

Combinatorial Optimization: Algorithms and Complexity

Name: Combinatorial Optimization: Algorithms and Complexity
ISBN: 9780486402581

Christos H. Papadimitriou, Kenneth Steiglitz

0 / 0

0 comments

你有多喜欢这本书？

下载文件的质量如何？

下载该书，以评价其质量

下载文件的质量如何？

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. 1982 ed.

种类:

Mathematics - Optimization. Operations Research

年:

1998

出版:

Unabridged

出版社:

Dover Publications

语言:

english

页:

513