IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v351y2025i1d10.1007_s10479-024-06003-7.html
   My bibliography  Save this article

A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints

Author

Listed:
  • Raouia Taktak

    (Université de Sfax
    Centre de Recherche en Numérique de Sfax)

Abstract

This paper deals with a variant of the traveling salesman problem (TSP), called the multiple Steiner TSP with order constraints. This consists, given an undirected graph with nonnegative weights on the edges, and a set of salesmen such that with each salesman is associated a set of ordered terminals, in finding a minimum-cost subgraph containing for each salesman a tour going in order through its terminals. We propose an integer linear programming (ILP) formulation for the problem. We identify new families of valid inequalities and devise separation algorithms. Using this, we propose a Branch-and-Cut algorithm. The efficiency of our algorithm is shown through an extensive computational study.

Suggested Citation

  • Raouia Taktak, 2025. "A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints," Annals of Operations Research, Springer, vol. 351(1), pages 993-1021, August.
    • Handle: RePEc:spr:annopr:v:351:y:2025:i:1:d:10.1007_s10479-024-06003-7
    DOI: 10.1007/s10479-024-06003-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06003-7
    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-024-06003-7?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:1:d:10.1007_s10479-024-06003-7. 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.