{"product_id":"combinatorial-optimization","title":"Combinatorial Optimization","description":"Clearly written 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; approximation algorithms, local search heuristics for NP-complete problems, more. \"Mathematicians wishing a self-contained introduction need look no further.\" — American Mathematical Monthly. 1982 edition.","brand":"MediaPlace","offers":[{"title":"Default Title","offer_id":57321382150526,"sku":"NW9780486402581","price":21.95,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1379\/1261\/files\/9780486402581.jpg?v=1778699821","url":"https:\/\/mediaplace.com\/en-eu\/products\/combinatorial-optimization","provider":"MediaPlace","version":"1.0","type":"link"}