Maximum flow Minimum Cost Problem in a Network
| dc.contributor.advisor | Guta Berhanu (PhD) | |
| dc.contributor.author | Tsegay Tsadkan | |
| dc.date.accessioned | 2020-12-16T08:38:56Z | |
| dc.date.accessioned | 2023-11-04T12:31:07Z | |
| dc.date.available | 2020-12-16T08:38:56Z | |
| dc.date.available | 2023-11-04T12:31:07Z | |
| dc.date.issued | 2014-06-06 | |
| dc.description.abstract | Maximum ow minimum cost(MFMC) problem combines sending as much ow as possible from the source node to the sink node with minimum cost.Here the attributes for the network are the capacity,ow and cost per unit ow of an arc which varies linearly with the amount of ow.The problem has two special problems namely the shortest path problem and maximum ow problem for which we set all the capacities and cost are set to be zero respectively.Solving maximum ow minimum cost involves two steps;_nding the maximum ow and then _nd the minimum cost using the feasible ow as an input. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/24117 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Maximum-Flow Minimum Cost | en_US |
| dc.subject | S-T Cut | en_US |
| dc.subject | Ford Fulkerson Labeling Algorithm | en_US |
| dc.subject | Network Simplex Algorithm | en_US |
| dc.title | Maximum flow Minimum Cost Problem in a Network | en_US |
| dc.type | Thesis | en_US |