• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      A successive algorithm for the Chinese Postman Problem

      Thumbnail
      View / Download
      1.5 Mb
      Author(s)
      Narin, Noyan
      Advisor
      Akgül, Mustafa
      Date
      1991
      Publisher
      Bilkent University
      Language
      English
      Type
      Thesis
      Item Usage Stats
      188
      views
      370
      downloads
      Abstract
      The Chinese Postman Problem being one of the well known problems in combinatorial optimization has many applications in real life problems such as mail delivery, road maintenance and bus scheduling. In this thesis work, we present a successive algorithm for the solution of Chinese Postman Problem. Additionally, we present efficient data structures for the existing algorithms in literature and for the implementation of our successive algorithm.
      Keywords
      Chinese Postman Problem
      Successive algorithms
      Blossom algorithm
      Matching
      Permalink
      http://hdl.handle.net/11693/17322
      Collections
      • Dept. of Industrial Engineering - Master's degree 355
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy