Combinatorial Optimization: Algorithms and Complexity [Hardcover - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. 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: Algorithms and Complexity [Hardcover - Used]