IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v351y2025i3d10.1007_s10479-025-06641-5.html
   My bibliography  Save this article

A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme

Author

Listed:
  • Sophia Saller

    (Deutsches Forschungszentrum für Künstliche Intelligenz)

  • Jana Koehler

    (Lucerne University of Applied Sciences and Arts)

  • Andreas Karrenbauer

    (Max Planck Institute for Informatics)

Abstract

The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: e.g., engineering, physics, biology, life sciences, and manufacturing. Several thousand papers are published every year. This paper provides the first systematic survey on the best currently known approximability and inapproximability results for well-known TSP variants such as the “standard”, Path, Bottleneck, Maximum Scatter, Generalized, Clustered, Quota, Prize-Collecting, Time-dependent TSP, Traveling Purchaser Problem, Profitable Tour Problem, Orienteering Problem, TSP with Time Windows, and Orienteering Problem with Time Windows. The foundation of our survey is the definition scheme TSP-T3CO , which we propose as a uniform, easy-to-use and extensible means for the formal and precise definition of TSP variants. Applying TSP-T3CO to define a TSP variant reveals subtle differences within the same named variant and also brings out the differences between variants more clearly. We achieve the first comprehensive, concise, and compact representation of approximability results by using TSP-T3CO definitions. This makes it easier to understand the approximability landscape and the assumptions under which certain results hold. Open gaps become more evident and results can be compared more easily. Graphical abstract

Suggested Citation

  • Sophia Saller & Jana Koehler & Andreas Karrenbauer, 2025. "A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme," Annals of Operations Research, Springer, vol. 351(3), pages 2129-2190, August.
    • Handle: RePEc:spr:annopr:v:351:y:2025:i:3:d:10.1007_s10479-025-06641-5
    DOI: 10.1007/s10479-025-06641-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06641-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06641-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:351:y:2025:i:3:d:10.1007_s10479-025-06641-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.