Abstract
The paper deals with a variant of the Traveling Saleman Problem (TSP), called the Multiple Steiner TSP with Order Constraints (MSTSPOC). Consider an undirected weighted graph, and a set of salesmen such that with each salesman is associated a set of ordered terminals. The MSTSPOC consists in finding a minimum-cost subgraph containing for each salesman a tour going in order through its terminals. We propose an ILP formulation for the problem, study the associated polytope and investigate the facial aspects of the basic constraints. We further identify new families of valid inequalities. Some computational results are also presented.
Author supplied keywords
Cite
CITATION STYLE
Taktak, R., & Uchoa, E. (2020). On the multiple steiner traveling salesman problem with order constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 66–77). Springer. https://doi.org/10.1007/978-3-030-53262-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
