Annals of Operations Research

, Volume 110, Issue 1, pp 55–68

Minmax p-Traveling Salesmen Location Problems on a Tree

  • Igor Averbakh
  • Oded Berman

DOI: 10.1023/A:1020759332183

Cite this article as:
Averbakh, I. & Berman, O. Annals of Operations Research (2002) 110: 55. doi:10.1023/A:1020759332183


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.

polynomial algorithm location traveling salesman problem 

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Igor Averbakh
    • 1
  • Oded Berman
    • 2
  1. 1.Division of ManagementUniversity of Toronto at ScarboroughScarboroughCanada
  2. 2.Rotman School of ManagementUniversity of TorontoTorontoCanada

Personalised recommendations