Minmax p-Traveling Salesmen Location Problems on a Tree
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Suppose that p traveling salesmen must visit together all points of a tree, and the objective is to minimize the maximum of the lengths of their tours. The location–allocation version of the problem (where both optimal home locations of the salesmen and their optimal tours must be found) is known to be NP-hard for any p≥2. We present exact polynomial algorithms with a linear order of complexity for location versions of the problem (where only optimal home locations must be found, without the corresponding tours) for the cases p=2 and p=3.
- I. Averbakh and O. Berman, A heuristic with worst-case analysis for minimax routing of Two Traveling Salesmen on a tree, Discrete Applied Mathematics 68 (1996) 17-32.
- I. Averbakh and O. Berman, (p-1)/(p + 1)-approximate algorithms for p-Traveling Salesmen problems on a tree with minmax objective, Discrete Applied Mathematics 75 (1997) 201-216.
- P.M. Franka, M. Gendreau, G. Laporte and F. Muller, The m-Travelling Salesmen problem with minmax objective, Publication 869, Centre de recherche sur les transports (Montreal) 1992.
- G.N. Frederickson, M.S. Hecht and C.E. Kim, Approximation algorithms for some routing problems, SIAM Journal on Computing 7 (1978) 178-193.
- M. Hall, Combinatorial Theory, 2nd edn. (Wiley, New York, 1986).
- G. Laporte, M. Desrochers and Y. Nobert, Two exact algorithms for the distance-constrained vehicle routing problem, Networks 14 (1984) 161-172.
- Minmax p-Traveling Salesmen Location Problems on a Tree
Annals of Operations Research
Volume 110, Issue 1-4 , pp 55-68
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- polynomial algorithm
- traveling salesman problem
- Industry Sectors