|
|
|
|
|
Víctor Pacheco-Valencia, José Alberto Hernández, José María Sigarreta and Nodari Vakhania
The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem,...
ver más
|
|
|
|
|