• See large image

  Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) (Paperback) By (author) Christos H. Papadimitriou, By (author) Kenneth Steiglitz

  

  $17.37 - Save $4.58 20% off - RRP $21.95 Free shipping worldwide (to United States and
  all these other countries) Usually dispatched within 48 hours Add to basket | Add to wishlist |

  Short Description for Combinatorial Optimization This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
  Full description

  • Publisher: Dover Publications Inc.
  • Published: 01 February 2000
  • Format: Paperback 528 pages
  • See: Full bibliographic data
  • Categories: Optimization | Combinatorics & Graph Theory
  • ISBN 13: 9780486402581 ISBN 10: 0486402584
  • Sales rank: 125,716

• Logicomix

  

  Add to basket $22.95 -

• A First Course in Optimization T...

  

  Add to basket $39.36 - Save $8.63 17% off - RRP $47.99

• Computational Geometry

  

  Add to basket $43.69 - Save $6.26 12% off - RRP $49.95

• Logicomix

  

  Add to basket $23.33 - Save $14.17 37% off - RRP $37.50

• Introduction to Graph Theory

  

  Add to basket $13.51 - Save $1.44 (9%) - RRP $14.95

Full description for Combinatorial Optimization

• This book brings together in one volume the important ideas of computational complexity developed by computer scientists with the foundations of mathematical programming developed by the operations research community.