Combinatorial Optimization: Algorithms and Complexity (Paperback)

This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."—American Mathematical Monthly. 1982 ed.

這本寫得清晰且數學嚴謹的書籍包含了對單純形法的新穎演算法解說，並討論了蘇聯橢球演算法用於線性規劃的方法；還包括了網路流、匹配、生成樹和鈎子的高效演算法；NP完全問題的理論；近似演算法，以及NP完全問題的局部搜索啟發式方法等。每一章都附有引人思考的問題。這是一本對於具備計算機科學、運籌學和電機工程背景的研究生學生非常有用的著作。"數學家們若希望找到一本自成一體的入門書，不需要再尋找其他了。" - 《美國數學月刊》。1982年版。