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 "Kefale, Adugna"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    (Submitted in partial fulfillment of the M.Sc.degree in mathematics)
    (Addis Ababa University, 2014-06) Kefale, Adugna; Guta, Berhanu(PhD)
    Symmetric travelling sales man problem is a well known combinatorial optimization problem .It is a problem of findining the shortest Hamiltonian cycle in a given weighted graph. In this project paper the symmetric travelling sales man problem, together with its mathematical formulation and solution method ,especially the exact solution (Branch and bound approach) and an approximate(Heuristics approach) have been covered

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

Addis Ababa University © 2023