{"product_id":"network-flows-theory-algorithms-and-applications-013617549x-used","title":"Network Flows: Theory, Algorithms, and Applications","description":"\u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 013617549X\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Magnanti, Thomas\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e Used\u003c\/p\u003e\u003cp\u003eA comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. devotes a special chapter to conducting empirical testing of algorithms. features over 150 applications of network flows to a variety of engineering, management, and scientific domains. contains extensive reference notes and illustrations.\u003c\/p\u003e\u003cul\u003e\u003cli\u003epresents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. | emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. | provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. | devotes a special chapter to conducting empirical testing of algorithms. | features over 150 applications of network flows to a variety of engineering, management, and scientific domains. | contains extensive reference notes and illustrations.\u003c\/li\u003e\u003c\/ul\u003e","brand":"Mia Karts","offers":[{"title":"Default Title","offer_id":67639035822368,"sku":"USED013617549X","price":239.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0980\/7426\/3840\/files\/91flILIyAnL_519ead6e-72ea-4c91-bbf3-0f2bd3af583e.jpg?v=1791169722","url":"https:\/\/miakarts.com\/en-gb\/products\/network-flows-theory-algorithms-and-applications-013617549x-used","provider":"Miakarts Books","version":"1.0","type":"link"}