ISBN: 9783843394147

Paperback, [PU: LAP Lambert Academic Publishing], Optimizing (maximizing or minimizing) is a basic need of human being. There are many real life problems that need the process of optimiza… Mehr…

Paperback, [PU: LAP Lambert Academic Publishing], 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., Economics, Economics<

ISBN: 9783843394147

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 maximu… Mehr…

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. Bücher, Hörbücher & Kalender / Bücher / Sachbuch / Wirtschaft<

2011, ISBN: 3843394148

[EAN: 9783843394147], Neubuch, [PU: LAP Lambert Academic Publishing], WIRTSCHAFT, Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung für Sie gedruckt. Optimizi… Mehr…

[EAN: 9783843394147], Neubuch, [PU: LAP Lambert Academic Publishing], WIRTSCHAFT, Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung für Sie gedruckt. 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 p, Books<

2011, ISBN: 9783843394147

LAP LAMBERT Academic Publishing, Taschenbuch, 64 Seiten, Publiziert: 2011-02-06T00:00:01Z, Produktgruppe: Book, 0.23 kg, Recht, Kategorien, Bücher, Wirtschaftslehre, Wirtschaft, Business … Mehr…

LAP LAMBERT Academic Publishing, Taschenbuch, 64 Seiten, Publiziert: 2011-02-06T00:00:01Z, Produktgruppe: Book, 0.23 kg, Recht, Kategorien, Bücher, Wirtschaftslehre, Wirtschaft, Business & Karriere, Börse & Geld, LAP LAMBERT Academic Publishing, 2011<

2011, ISBN: 3843394148

Kartoniert / Broschiert, mit Schutzumschlag neu, [PU:LAP Lambert Acad. Publ.]