The traveling salesman problem (TSP) i perhap s s the most well known combinatorial optimization problem. The book "The Travehng Sales man Problem: A guided tour of combinatorial optimization" edited by Lawler, Lenstra, Rinoo Ka y n and Shmoys provides the state of the art description of the topi u …