Electronic Resource
Springer
Annals of operations research
18 (1989), S. 261-266
ISSN:
1572-9338
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract This note considers a variant of the traveling salesman problem in which we seek a route that minimizes the total of the vertex arrival times. This problem is called the deliverly man problem. The traveling salesman problem is NP-complete on a general network and trivial on a tree network. The delivery man problem is also NP-complete on a general network but far from trivial on a tree network. Various characteristics of the delivery man problem for tree networks are explored and a pseudo-polynomial time solution algorithm is proposed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02097807
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |