1 paper · 1 filter
Matthias Gehnen, Ralf Klasing, Émile Naquin
In the Travelling Salesman Problem, every vertex of an edge-weighted graph has to be visited by an agent who traverses the edges of the graph. In this problem, it is usually assume…