{"product_id":"9780792348788","title":"The Quadratic Assignment Problem : Theory and Algorithms (Combinatorial Optimization, V. 1)","description":"\u003cp\u003eThe quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem.\u003c\/p\u003e","brand":"Kluwer Academic Pub","offers":[{"title":"Default Title","offer_id":52525704020279,"sku":"00000_00000_00000_00000","price":921.0,"currency_code":"MYR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0962\/3548\/7543\/files\/9780792348788-1.jpg?v=1783125690","url":"https:\/\/kinokuniya.com.my\/products\/9780792348788","provider":"Books Kinokuniya Malaysia","version":"1.0","type":"link"}