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.
Read More
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.
Read Less
Add this copy of Combinatorial Optimization: Algorithms and Complexity to cart. $115.97, new condition, Sold by GridFreed rated 5.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1981 by Prentice Hall.
