tsp_dantzig42_test

tsp_dantzig42_test, an Octave code which calls tsp_dantzig42(), which returns the (x,y) coordinates of the cities that constitute the Dantzig 42 state challenge for the Traveling Salesman Problem (TSP).

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

tsp_dantzig42, an Octave code which returns the (x,y) coordinates of the cities that constitute the Dantzig 42 state challenge for the Traveling Salesman Problem (TSP).

Source Code:

• tsp_dantzig42_test.m, calls all the tests.
• tsp_dantzig42_test.sh, runs all the tests.
• tsp_dantzig42_test.txt, the output file.

• dantzig42.png, a plot of the city locations.