Combinatorial Optimization: Algorithms and Complexity [first edition]
Compare buying options
14 live offers. The cheapest is new.Product Description
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.
Set Price Drop
Get an alert as soon as it’s on sale.
Alert set
We’ll let you know when any store drops to your price or lower.
Video reviews
Reviews of this product on YouTube.Just For You
Stores we recommend, with today’s cash back rates.
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop
Activate & Shop




