Minimum Cost Maximum Flow Problem
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Getnet, Haileleule | |
| dc.date.accessioned | 2018-07-16T11:09:20Z | |
| dc.date.accessioned | 2023-11-04T12:30:36Z | |
| dc.date.available | 2018-07-16T11:09:20Z | |
| dc.date.available | 2023-11-04T12:30:36Z | |
| dc.date.issued | 2017-06 | |
| dc.description.abstract | This work presents an algorithm for computing the maximum flow and minimum cost flow problem of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm is equivalent to just applying Ford and Fulkerson algorithm to the directed graph obtained from original graph but with two directed arcs for each edge in the graph, one in each way. We shall also discuss a range of network problems and finally discuss in details the minimum cost maximum flow problem. Network models in this chapter will focus on techniques of finding the most efficient ways of finding the shortest route between two locations; determine the minimum-cost flow in a network that satisfies supply and demand requirements that will produce maximum flow in the network. Goal: Build a cheap network to satisfy the flow requirement Keywords: Max Flow, Minimum Cost, Parametric Flow | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8769 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Max Flow | en_US |
| dc.subject | Minimum Cost | en_US |
| dc.subject | Parametric Flow | en_US |
| dc.title | Minimum Cost Maximum Flow Problem | en_US |
| dc.type | Thesis | en_US |