Keskinocak, Pınar2016-01-082016-01-081992http://hdl.handle.net/11693/17429Ankara : Department of Industrial Engineering and the Institute of Engineering of Bilkent University, 1992.Thesis (Master's) -- Bilkent University, 1992.Includes bibliographical references leaves 42-44In 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.viii, 44 leavesEnglishinfo:eu-repo/semantics/openAccessDelivery Man ProblemPolyhedral ApproachCutting PlaneQA402.5 .K47 1992Traveling-salesman problem.Heuristic programming.Mathematical optimization.Polyhedra.Quadratic programming.Thesis