A time- and space-optimal algorithm for the many-visits TSP

André Berger, László Kozma, Matthias Mnich +1

The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of $n$ cities that visits each city $c$ a prescribed number $k_c$ of times. Travel costs may be asym…