Minmax p-traveling salesmen location problems on a tree

Annals of Operations Research

Volumn 110, Issue 1-4, 2002, Pages 55-68

  Averbakh, Igor ^a   Berman, Oded ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Location; Polynomial algorithm; Traveling salesman problem

Indexed keywords

EID: 0036035358     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1020759332183     Document Type: Article

References (6)

1. 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.
2. 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.
3. 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.
4. G.N. Frederickson, M.S. Hecht and C.E. Kim, Approximation algorithms for some routing problems, SIAM Journal on Computing 7 (1978) 178-193.
5. M. Hall, Combinatorial Theory, 2nd edn. (Wiley, New York, 1986).
6. G. Laporte, M. Desrochers and Y. Nobert, Two exact algorithms for the distance-constrained vehicle routing problem, Networks 14 (1984) 161-172.