Combinatorial Optimization: Algorithms and Complexity
by Christos H. Papadimitriou, Kenneth Steiglitz
249 Members (3.93)
On This Page
Description
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 show more backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. show lessTags
Recommendations
Member Reviews
Members
- Recently Added By
Author Information
9+ Works 3,127 Members
2 Works 255 Members
Series
Belongs to Publisher Series
Common Knowledge
- Canonical title*
- Combinatorial Optimization : Algorithms and Complexity
- Original publication date
- 1982
*Some information comes from Common Knowledge in other languages. Click "Edit" for more information.
Classifications
Statistics
- Members
- 249
- Popularity
- 130,274
- Rating
- (3.93)
- Languages
- English, Spanish
- Media
- Paper, Ebook
- ISBNs
- 5
- UPCs
- 1
- ASINs
- 1
