{"product_id":"combinatorial-optimization-networks-and-matroids","title":"Combinatorial Optimization: Networks and Matroids","description":"\u003cp\u003e\u003cb\u003eAuthor:\u003c\/b\u003e Eugene Lawler\u003c\/p\u003e\u003cp\u003e\u003cb\u003eBrand:\u003c\/b\u003e Dover\u003c\/p\u003e\u003cp\u003e\u003cb\u003eEdition:\u003c\/b\u003e Reprint\u003c\/p\u003e\u003cp\u003e\u003cb\u003eBinding:\u003c\/b\u003e paperback\u003c\/p\u003e\u003cp\u003e\u003cb\u003eNumber Of Pages:\u003c\/b\u003e 384\u003c\/p\u003e\u003cp\u003e\u003cb\u003eRelease Date:\u003c\/b\u003e 13-10-2011\u003c\/p\u003e\u003cp\u003e\u003cb\u003eDetails:\u003c\/b\u003e Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eEAN:\u003c\/b\u003e 0800759414536\u003c\/p\u003e\u003cp\u003e\u003cb\u003ePackage Dimensions:\u003c\/b\u003e 8.4 x 5.4 x 1.0 inches\u003c\/p\u003e\u003cp\u003e\u003cb\u003eLanguages:\u003c\/b\u003e English\u003c\/p\u003e","brand":"Dover","offers":[{"title":"Default Title","offer_id":50212708221232,"sku":"Trans_9780486414539","price":1896.0,"currency_code":"INR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0690\/9968\/4144\/files\/71H6qdr4RhL.jpg?v=1760338366","url":"https:\/\/www.retailmaharaj.com\/products\/combinatorial-optimization-networks-and-matroids","provider":"Retail Maharaj","version":"1.0","type":"link"}