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

Browsing by Author "Atitebi, O. S."

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    Item
    The traveling salesman problem: algorithms, sub-tours and applications in combinatorial optimization
    (Department of Industrial and Production Engineering, University of Ibadan, 2020) Oladokun, V. O.; Odedairo, B. O.; Atitebi, O. S.
    The importance of the traveling salesman problem (TSP) in combinatorial optimization and its application and adaptability to numerous real-life problems has led to the development of a wide range of algorithms. A major issue in the development of TSP algorithm involves how to handle the large number of subtour eliminating constraints which contribute to the exponential growth of computational time associated with TSP algorithms. In this chapter, basic concepts, development and many numerous research efforts of Professor O.E. Charles-Owaba on TSP were discussed; some of his works on the concept of the TSP set sequencing algorithm were highlighted.

DSpace software copyright © 2002-2025 Customised by Abba and King Systems LLC

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify