Skip to main content
SpringerLink
Log in

Minmax p-Traveling Salesmen Location Problems on a Tree

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  5. M. Hall, Combinatorial Theory, 2nd edn. (Wiley, New York, 1986).

    Google Scholar 

  6. G. Laporte, M. Desrochers and Y. Nobert, Two exact algorithms for the distance-constrained vehicle routing problem, Networks 14 (1984) 161-172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Management, University of Toronto at Scarborough, Scarborough, Ontario, M1C 1A4, Canada

    Igor Averbakh

  2. Rotman School of Management, University of Toronto, Toronto, Ontario, M5S 3E6, Canada

    Oded Berman

Authors
  1. Igor Averbakh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oded Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Averbakh, I., Berman, O. Minmax p-Traveling Salesmen Location Problems on a Tree. Annals of Operations Research 110, 55–68 (2002). https://doi.org/10.1023/A:1020759332183

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020759332183

Search

Navigation