For the best experience, please enable Javascript
x
Warning - This version of Internet Explorer is out of date. It has known security flaws and may not display all features of this website correctly. Please consider updating this browser.

Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity

By: Christos H. Papadimitriou, Kenneth Steiglitz

  • Book
  • Reg. Price › $21.95
  • eBook
  • Sale Price › $17.56
  • Paperback + eBook
  • Reg. Price › $24.15
  • Share this book:
  • Share on Google+

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.

Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
AvailabilityUsually ships in 24 to 48 hours
ISBN 100486402584
ISBN 139780486402581
Author/EditorChristos H. Papadimitriou Kenneth Steiglitz
FormatBook
Page Count528
Dimensions5 3/8 x 8 1/2

You might also Like...

Product Review

<--!Google Universal Analytics Code!-->
Out of Stock Notification:
Coming Soon: