In Partial Fulfilment of the Requirement of the Degree of Master of Science in Mathematics
| dc.contributor.advisor | Guta, Berhanu(PhD) | |
| dc.contributor.author | Tsegaye, Temesgen | |
| dc.date.accessioned | 2018-07-18T08:11:09Z | |
| dc.date.accessioned | 2023-11-04T12:30:41Z | |
| dc.date.available | 2018-07-18T08:11:09Z | |
| dc.date.available | 2023-11-04T12:30:41Z | |
| dc.date.issued | 2011-06 | |
| dc.description.abstract | Fixed Charge Network Flow Problem (FCNFP) is a well known NP-hard problem. It has a wide spectrum of applications. Among them are problems in network design, scheduling, production planning, supply chain and transportation science. Many exact methods and heuristic approach have been developed to solve the FCNFP. In this project, I focused on some exact method such as Branch-and-cut method to solve single commodity uncapacitated fixed charge network flow problem, and exact algorithm for fixed charge transportation problem. In addition, there is also one greedy (heuristic) algorithm to solve the uncapacitated facility location problem which is a special case of fixed charge network flow problem | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/9211 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | In Partial Fulfilment of the Requirement of the Degree | en_US |
| dc.title | In Partial Fulfilment of the Requirement of the Degree of Master of Science in Mathematics | en_US |
| dc.type | Thesis | en_US |