Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
Repository logo
  • Colleges, Institutes & Collections
  • Browse AAU-ETD
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Tsegaye, Temesgen"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    In Partial Fulfilment of the Requirement of the Degree of Master of Science in Mathematics
    (Addis Ababa University, 2011-06) Tsegaye, Temesgen; Guta, Berhanu(PhD)
    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

Home |Privacy policy |End User Agreement |Send Feedback |Library Website

Addis Ababa University © 2023