Sandra Gutiérrez

The Mexican Magical Towns Traveling Salesman Problem: Preliminary Results

2017 · Research in Computing Science

The Traveling Salesman Problem (TSP) is a classical NPhard combinatorial problem that has been intensively studied through several decades. A large amount of literature is dedicated to this problem. TSP can be directly applied to …