The delivery man problem and cumulative matroids
Operations Research
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
P-Complete Approximation Problems
Journal of the ACM (JACM)
On-line single-server dial-a-ride problems
Theoretical Computer Science
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Minimum Latency Problem Is NP-Hard for Weighted Trees
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Exact algorithms for the minimum latency problem
Information Processing Letters
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Branch and bound algorithm for a single vehicle routing problem with toll-by-weight scheme
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
The time dependent traveling salesman problem: polyhedra and branch-cut-and-price algorithm
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The Delivery Man Problem with time windows
Discrete Optimization
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Discrete Applied Mathematics
| Hi-index | 0.04 |
The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamiltonian path equals the sum of the costs for the layers of paths (along the Hamiltonian path) going from the depot vertex to each of the remaining vertices. In this paper, we propose a new Integer Programming formulation for the problem and computationally evaluate the strength of its Linear Programming relaxation. Computational results are also presented for a cutting plane algorithm that uses a number of valid inequalities associated with the proposed formulation. Some of these inequalities are shown to be facet defining for the convex hull of feasible solutions to that formulation. These inequalities proved very effective when used to reinforce Linear Programming relaxation bounds, at the nodes of a Branch and Bound enumeration tree.