Many-visits multiple traveling salesman problems
A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of salesmen jointly visit all cities from a set of cities. The mTSP models many important real-life applications, in particular for vehicle routing problems. In our paper titled Many-visits multiple traveling salesman problems that was recently…