In print
Ebook
Audiobook
Library
We may earn a commission. Learn more.
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.
No reviews yet.
Be the first to write one.
No highlights yet.
Be the first to share one.