Narin, Noyan2016-01-082016-01-081991http://hdl.handle.net/11693/17322Ankara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1991.Thesis (Master's) -- Bilkent University, 1991.Includes bibliographical refences.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.vii, 62 leavesEnglishinfo:eu-repo/semantics/openAccessChinese Postman ProblemSuccessive algorithmsBlossom algorithmMatchingQA402.5 .N37 1991Chinese postman's problem.Graph theory.Combinatorial optimization.Algorithms.Thesis