Bérczi, KristófKristófBércziMnich, MatthiasMatthiasMnichVincze, RolandRolandVincze2022-01-102022-01-102021arXiv: 2201.02054 (2021)http://hdl.handle.net/11420/11435A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of m salesmen jointly visit all cities from a set of n cities. The mTSP models many important real-life applications, in particular for vehicle routing problems. An extensive survey by Bektas (Omega 34(3), 2006) lists a variety of heuristic and exact solution procedures for the mTSP, which quickly solve particular problem instances. In this work we consider a further generalization of mTSP, the many-visits mTSP, where each city v has a request r(v) of how many times it should be visited by the salesmen. This problem opens up new real-life applications such as aircraft sequencing, while at the same time it poses several computational challenges. We provide multiple efficient approximation algorithms for important variants of the many-visits mTSP, which are guaranteed to quickly compute high-quality solutions for all problem instances.enhttp://rightsstatements.org/vocab/InC/1.0/MathematikEfficient approximations for many-visits multiple traveling salesman problemsPreprint10.15480/882.452410.48550/arXiv.2201.0205410.15480/882.45242201.0205410.15480/882.4873Preprint