• See large image

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

  

  $20.86 - Save $12.52 37% off - RRP $33.38 Free delivery worldwide (to United States and
  all these other countries) Usually dispatched within 48 hours Add to basket | Add to wishlist |

  Short Description for Combinatorial OptimizationThis 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 496 pages
  • See: Full bibliographic data
  • Categories: Optimization | Combinatorics & Graph Theory
  • ISBN 13: 9780486402581 ISBN 10: 0486402584
  • Sales rank: 87,787

• Computational Geometry

  

  Add to basket $45.30 - Save $2.39 (5%) - RRP $47.69

• Logicomix

  

  Add to basket $25.66 - Save $1.36 (5%) - RRP $27.02

• Introduction to Graph Theory

  

  Add to basket $14.20 - Save $8.05 36% off - RRP $22.25

• Linear Algebra

  

  Add to basket $16.11 - Save $12.50 43% off - RRP $28.61

• Logicomix

  

  Add to basket $21.42 - Save $1.52 (6%) - RRP $22.94

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.