A polyhedral approach to delivery man problem
Date
1992
Authors
Editor(s)
Advisor
Akgül, Mustafa
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Volume
Issue
Pages
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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.
Course
Other identifiers
Book Title
Keywords
Degree Discipline
Industrial Engineering
Degree Level
Master's
Degree Name
MS (Master of Science)