Combinatorial Optimization: Algorithms and Complexity

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

• | Author: Christos H. Papadimitriou, Kenneth Steiglitz
• | Publisher: Dover Publications Inc.
• | Publication Date: Feb 01, 2000
• | Number of Pages:
• | Language:
• | Binding: Paperback / softback
• | ISBN-13: 9780486402581
• | ISBN-10: 0486402584