You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?"
Trabajo de Fin de Grado, dedicado al problema "Viajante del Comercio"/"Travelling Salesman Problem". Dicho trabajo consta de un análisis del problema, aplicación de una metodología propia de investigación y el diseño de un algoritmo que ofrezca resultados satisfactorios al problema.