{"product_id":"combinatorial-optimization-algorithms-and-complexity-9780486402581","title":"Combinatorial Optimization: Algorithms and Complexity","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.\" -- \u003ci\u003eAmerican Mathematical Monthly.\u003c\/i\u003e\u003cbr\u003e","brand":"Dover Publications","offers":[{"title":"Default Title","offer_id":50412537676050,"sku":"9780486402581","price":21.99,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0831\/4771\/8930\/files\/img_934480b3-7971-4e67-a6c7-126016a1064a.jpg?v=1729315980","url":"https:\/\/surprise-castle.myshopify.com\/products\/combinatorial-optimization-algorithms-and-complexity-9780486402581","provider":"Surprise Castle","version":"1.0","type":"link"}