Buy Textbooks  |  Rent Textbooks  |  Sell Textbooks  |  eTextbooks
Help  |  Questions? 1-877-292-6442
Hello, Sign In
Your Account
0

Combinatorial Optimization - 98 edition

Combinatorial Optimization (ISBN10: 0486402584; ISBN13: 9780486402581)
ISBN13: 978-0486402581
ISBN10: 0486402584

Summary: 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 w
ith backgrounds in computer science, operations research, and electrical engineering. ''Mathematicians wishing a self-contained introduction need look no further.''-American Mathematical Monthly. 1982 edition.
...show more
Summary: 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 edition. ...show less

Edition/Copyright: 98
Cover: Paperback
Publisher: Dover Publications, Inc.
Year Published: 1998
International: No



List Price: $21.95
Used $8.56
New  Currently Sold Out
Rental $9.99
Due back 12/18/2015
Rental
Save $11.96 (54%)
  • Free return shipping
  • In stock
  • 21-day satisfaction guarantee
CDs or access codes may not be included
Close
Close
Close