Combinatorial Optimization : Algorithms and Complexity

Christos H Papadimitriou; Kenneth Steiglitz
Dover Publications
9780486402581
0-486-40258-4

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;.

read more…

local search heuristics for NP-complete problems, more. 1982 edition.