{"product_id":"finding-a-maximum-value-flow-in-pure-network-von-araniyos-terefe","title":"FINDING A MAXIMUM VALUE FLOW IN PURE NETWORK","description":"\u003cp\u003eOptimizing (maximizing or minimizing) is a basic  need of human being. There are many real life problems that need the process of optimization; one of it is the problem of finding a maximum value flow in a single commodity network. A maximum value flow in a pure network can be calculated by different methods with different computational complexity. One of the earliest methods is the Ford-Fulkerson Algorithm with limited practical use. Hence, among the different methods this book emphasized on Dinic''s method for getting a maximum value flow in pure network (single commodity flow) with very best  running time. The method is applied after  constructing an auxiliary network (layered network)  with respect to the present flow vector in a given  network. This process identifies and includes those  paths which are important for maximizing the flow  amount in the network. To get the maximum value  flow, the construction step of the layered network  would be carried out repeatedly. The book clearly  shows how to use the Dinic''s method appropriately  and contains clear examples for elaborating the  means to get a maximum value flow by the  aforementioned method.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783843394147\"\u003e\u003ch3\u003eDINIC'S METHOD FOR FINDING A MAXIMUM VALUE FLOW IN PURE NETWORK\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783843394147","offer_id":39497192865885,"sku":"9783843394147","price":49.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/dd08b2a7-9fb4-4b45-a66d-06f822d8190d.jpg?v=1737615201","url":"https:\/\/shop.autorenwelt.de\/en\/products\/finding-a-maximum-value-flow-in-pure-network-von-araniyos-terefe","provider":"Autorenwelt Shop","version":"1.0","type":"link"}