Category

FINDING A MAXIMUM VALUE FLOW IN PURE NETWORK

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 
₹ 3,651

Availability: Out of stock

 

Delivery :

Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description
 

Optimizing (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.

Product Specifications
SKU :COC69405
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
0 Review(s)