A note on the traveling repairman problem
Article first published online: 8 JUL 2002
Copyright © 2002 Wiley Periodicals, Inc.
Volume 40, Issue 1, pages 27–31, August 2002
How to Cite
García, A., Jodrá, P. and Tejel, J. (2002), A note on the traveling repairman problem. Networks, 40: 27–31. doi: 10.1002/net.10031
- Issue published online: 8 JUL 2002
- Article first published online: 8 JUL 2002
- Manuscript Accepted: APR 2002
- Manuscript Received: JUL 2000
- traveling repairman problem;
- minimum latency problem;
- dynamic programming;
- Monge matrices;
- computational complexity
Given a finite set of N nodes and the time required for traveling among nodes, in the traveling repairman problem, we seek a route that minimizes the sums of the delays for reaching each node. In this note, we present a linear algorithm for solving the traveling repairman problem when the underlying graph is a path, improving the Θ(N2) time and space complexity of the previously best algorithm for this problem. We also provide a linear algorithm for solving the walk problem with deadlines (WPD) on paths. © 2002 Wiley Periodicals, Inc.