Combinatorial Optimization：Algorithms and Complexity

Clearlywrittengraduate-leveltextconsiderstheSovietellipsoidalgorithmforlinearprogramming;efficientalgorithmsfornetworkflow,matching,spanningtrees,andmatroids;thetheoryofNP-completeproblems;approximationalgorithms,localsearchheuristicsforNP-completeproblems,more."Mathematicianswishingaself-containedintroductionneedlooknofurther."