In Partial Fulfilment of the Requirement of the Degree of Master of Science in Mathematics
No Thumbnail Available
Date
2011-06
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
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
Description
Keywords
In Partial Fulfilment of the Requirement of the Degree