TSP Generator (Mathfest 2002)   <-  Sean Forman   <-  You Are Here
   /

Traveling Salesman Problems

• Given a set of cities find the shortest (Hamiltonian) circuit traveling through each city.

• Visit each city once.

• Start and end in the same city.

• Symmetric problem: distance A to B = distance B to A.