A polyhedral approach to delivery man problem

Ankara : Department of Industrial Engineering and the Institute of Engineering of Bilkent University, 1992. Thesis (Master's) -- Bilkent University, 1992. Includes bibliographical references leaves 42-44 In 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. Keskinocak, Pınar M.S.

Country

Turkey

Related Organizations

Bilkent University
Turkey

Keywords

QA402.5 .K47 1992, Traveling-salesman problem, Polyhedral Approach, Quadratic programming., Mathematical optimization, Cutting Plane, Quadratic programming, Heuristic programming, Polyhedra., Mathematical optimization., Heuristic programming., Delivery Man Problem, Traveling-salesman problem., Polyhedra

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Green