Show simple item record

dc.contributor.advisorAkgül, Mustafaen_US
dc.contributor.authorKeskinocak, Pınaren_US
dc.date.accessioned2016-01-08T20:10:14Z
dc.date.available2016-01-08T20:10:14Z
dc.date.issued1992
dc.identifier.urihttp://hdl.handle.net/11693/17429
dc.descriptionAnkara : Department of Industrial Engineering and the Institute of Engineering of Bilkent University, 1992.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1992.en_US
dc.descriptionIncludes bibliographical references leaves 42-44en_US
dc.description.abstractIn this thesis we discuss some polyhedral approaches to the Delivery Man Problem(DMP),which is a special case of the Traveling .Scvlesman Problem(TSP). First, we look at two formulations of the problem and describe a combinatorial solution procedure for the linear programming relaxation.Then we give some valid inequalities and discuss a Lagrangean Relaxation procedure and a cutting plane procedure. Finally, we propose heuristics for tree graphs and general graphs and give computational results.en_US
dc.description.statementofresponsibilityKeskinocak, Pınaren_US
dc.format.extentviii, 44 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDelivery Man Problemen_US
dc.subjectPolyhedral Approachen_US
dc.subjectCutting Planeen_US
dc.subject.lccQA402.5 .K47 1992en_US
dc.subject.lcshTraveling-salesman problem.en_US
dc.subject.lcshHeuristic programming.en_US
dc.subject.lcshMathematical optimization.en_US
dc.subject.lcshPolyhedra.en_US
dc.subject.lcshQuadratic programming.en_US
dc.titleA polyhedral approach to delivery man problemen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record