menu
{ "item_title" : "Combinatorial Optimization", "item_author" : [" Christos H. Papadimitriou", "Kenneth Steiglitz "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/48/640/258/0486402584_b.jpg", "price_data" : { "retail_price" : "24.95", "online_price" : "24.95", "our_price" : "24.95", "club_price" : "24.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Combinatorial Optimization|Christos H. Papadimitriou
Combinatorial Optimization : Algorithms and Complexity
local_shippingFor Delivery
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Overview

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.

  • ISBN-13: 9780486402581
  • ISBN-10: 0486402584
  • Publisher: Dover Publications
  • Publish Date: January 1998
  • Dimensions: 8.47 x 5.48 x 1.04 inches
  • Shipping Weight: 1.17 pounds
  • Page Count: 528