1 paper
Arturo RodrÃguez-Almazán, Guillermo Rivas, Ricardo S. Alonso +2
The Traveling Salesman Problem (TSP) is a classical NP-hard problem in combinatorial optimization, where determining the shortest route among a set of cities becomes computationall…