Many visits TSP revisited

Łukasz Kowalik, Shaohua Li, Wojciech Nadara +2

We study the Many Visits TSP problem, where given a number $k(v)$ for each of $n$ cities and pairwise (possibly asymmetric) integer distances, one has to find an optimal tour that…