{"product_id":"paradigms-of-combinatorial-optimization","title":"Paradigms of Combinatorial Optimization","description":"\u003cp\u003eCombinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management.  The three volumes of the Combinatorial Optimization series aim to cover a wide range  of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization.\u003cbr\u003e \u003cbr\u003e \u003ci\u003eConcepts of Combinatorial Optimization\u003c\/i\u003e, is divided into three parts:\u003cbr\u003e - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;\u003cbr\u003e - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;\u003cbr\u003e - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.\u003c\/p\u003e","brand":"ISTE Ltd and John Wiley \u0026 Sons Inc","offers":[{"title":"Default Title","offer_id":54254145700184,"sku":"9781848216570","price":327.3,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0278\/1295\/4195\/files\/9781848216570.jpg?v=1780392643","url":"https:\/\/agendabookshop.com\/products\/paradigms-of-combinatorial-optimization","provider":"Agenda Bookshop","version":"1.0","type":"link"}