Properties of No-Depot MIN-MAX 2-Traveling-Salesmen Problem

  • Vladimir Bugera
Part of the Cooperative Systems book series (COSY, volume 3)


The Multiple Traveling Salesmen Problem (Multiple-TSP) has been considered in many variations. Some of them can be reduced to a regular TSP by introducing additional vertices. We discuss several modifications of the Multiple-TSP. Particularly, we consider MIN-MAX 2-TSP for which reduction to a regular TSP is not known. We discuss a connection between this class of problems and a subclass of self-dual monotonic Boolean functions.


Transportation Aircrafts 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Bellmore and S. Hong. Transformation of multisalesmen problem to the standard traveling salesman problem. J. Assoc. Comput. Machinery, 21: 500–504, 1974.MathSciNetMATHGoogle Scholar
  2. [2]
    P. M. Franca, M. Gendreau, G. Laporte, and F. M. Muller. The m-traveling salesman problem with minmax objective. Transportation Science, 29: 267–275, 1995.MATHCrossRefGoogle Scholar
  3. [3]
    E. Ya. Gabovich and I. I. Melamed. On constant discrete programming problems. Discrete Applied Mathematics, 2: 193–205, 1980.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    E. Giust. Optimisation de Tourness de Vehicules. Application a la Distribution de Gaz. M.Sc. Dissertation. Facultes Universitaires Notre-Dame de la Paix, Namur, Belgium, 1992.Google Scholar
  5. [5]
    M. R. Rao. A note on the multiple traveling salesmen problem. Operations Research, 28: 628–632, 1980.MATHCrossRefGoogle Scholar
  6. [6]
    Yu. A. Zuev. Threshold functions and threshold interpretations of Boolean functions. Matematicheskie Voprosy Kibernetiki, 5: 5–61, 1994. In Russian.MathSciNetMATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Vladimir Bugera
    • 1
  1. 1.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations