The Minimum Cost Maximum Flow Problem
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Solomon, Dawit | |
| dc.date.accessioned | 2020-12-16T07:33:15Z | |
| dc.date.accessioned | 2023-11-04T12:31:06Z | |
| dc.date.available | 2020-12-16T07:33:15Z | |
| dc.date.available | 2023-11-04T12:31:06Z | |
| dc.date.issued | 2012-01-01 | |
| dc.description.abstract | The main objective of this project is to present different approaches to solve minimum cost maximum flow problem, which is one of the problems we face in "network flow problems." The first chapter of this paper gives us basic definition of different terms that we use in the chapters that follows and introduction to different network problems, and the second chapter shows how to solve maximum flow problems and since we also need the knowledge to solve minimum cost flow problem we present it in chapter three. After we presented the pre-requisite in three chapters our main problem of interest comes in chapter four which is the minimum cost maximum flow problem. It deals with finding the minimum possible cost of the maximum flow in the given network. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/24109 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Maximum | en_US |
| dc.subject | Minimum | en_US |
| dc.subject | Cost | en_US |
| dc.subject | Flow Problem | en_US |
| dc.title | The Minimum Cost Maximum Flow Problem | en_US |
| dc.type | Thesis | en_US |