A successive algorithm for the Chinese Postman Problem
Author(s)
Advisor
Akgül, MustafaDate
1991Publisher
Bilkent University
Language
English
Type
ThesisItem Usage Stats
188
views
views
370
downloads
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.