A polyhedral approach to delivery man problem
Item Usage Stats
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.