Skip to main content
SpringerLink
Log in

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

  • Chapter
Recent Developments in Cooperative Control and Optimization

Part of the book series: Cooperative Systems ((COSY,volume 3))

Abstract

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.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Bellmore and S. Hong. Transformation of multisalesmen problem to the standard traveling salesman problem. J. Assoc. Comput. Machinery, 21: 500–504, 1974.

    MathSciNet  MATH  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  3. E. Ya. Gabovich and I. I. Melamed. On constant discrete programming problems. Discrete Applied Mathematics, 2: 193–205, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  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. M. R. Rao. A note on the multiple traveling salesmen problem. Operations Research, 28: 628–632, 1980.

    Article  MATH  Google Scholar 

  6. Yu. A. Zuev. Threshold functions and threshold interpretations of Boolean functions. Matematicheskie Voprosy Kibernetiki, 5: 5–61, 1994. In Russian.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA

    Vladimir Bugera

Authors
  1. Vladimir Bugera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Texas A&M University, College Station, Texas, USA

    Sergiy Butenko

  2. Air Force Research Laboratory, Eglin, Florida, USA

    Robert Murphey

  3. University of Florida, Gainsville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Bugera, V. (2004). Properties of No-Depot MIN-MAX 2-Traveling-Salesmen Problem. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds) Recent Developments in Cooperative Control and Optimization. Cooperative Systems, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0219-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0219-3_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7947-8

  • Online ISBN: 978-1-4613-0219-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation