Skip to main content

Combinatorial Optimization

April 26, 2013528 pages
No grades yet

or to grade, review, and add to your backlog.

Description

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.

Community reviews

No reviews yet

Be the first to review this book.