Combinatorial Optimization: Algorithms and Complexity

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.

Binding Type: Paperback
Publisher: Dover Publications
Published: 01/29/1998
ISBN: 9780486402581
Pages: 528
Weight: 1.17lbs
Size: 8.47h x 5.48w x 1.04d