Combinatorial Optimization: Algorithms and Complexity,New
4.5 (1,234)
Sold 100+ last 30 days
20% off first order
$322.46
Color
Black
Quantity
Product description loading
Product description loading
This is the product description text that will appear here.
Quantity
1
Clearly written graduatelevel text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NPcomplete problems; approximation algorithms, local search heuristics for NPcomplete problems, more. 'Mathematicians wishing a selfcontained intro