Combinatorial Optimization Algorithms and Complexity

Christos H. Papadimitriou, Kenneth Steiglitz — 2013

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.