A successive algorithm for the Chinese Postman Problem

buir.advisorAkgül, Mustafa
dc.contributor.authorNarin, Noyan
dc.date.accessioned2016-01-08T20:09:13Z
dc.date.available2016-01-08T20:09:13Z
dc.date.issued1991
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1991.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1991.en_US
dc.descriptionIncludes bibliographical refences.en_US
dc.description.abstractThe 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.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityNarin, Noyanen_US
dc.format.extentvii, 62 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/17322
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectChinese Postman Problemen_US
dc.subjectSuccessive algorithmsen_US
dc.subjectBlossom algorithmen_US
dc.subjectMatchingen_US
dc.subject.lccQA402.5 .N37 1991en_US
dc.subject.lcshChinese postman's problem.en_US
dc.subject.lcshGraph theory.en_US
dc.subject.lcshCombinatorial optimization.en_US
dc.subject.lcshAlgorithms.en_US
dc.titleA successive algorithm for the Chinese Postman Problemen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
B008652.pdf
Size:
1.55 MB
Format:
Adobe Portable Document Format
Description:
Full printable version