tsp_dantzig42, a Fortran77 code which returns the (x,y) coordinates of the cities that constitute the Dantzig 42 state challenge for the Traveling Salesman Problem (TSP). The minimal tour is known to have length 699. Graphics files are created for processing by gnuplot().
The information on this web page is distributed under the MIT license.
tsp_dantzig42 is available in a C version and a C++ version and a Fortran77 version and a Fortran90 version and a MATLAB version and an Octave version and a Python version and an R version.
concorde, examples which call concorde(), which solves the traveling salesman problem (TSP), mixed integer programming, and related network optimization problems.
tsp, a dataset directory which contains test data for the traveling salesperson problem (TSP) including the AT&T 48 state capital test, and Dantzig's 42 city test;
tsp_att48, a Fortran77 code which returns the (x,y) coordinates of the cities that constitute the AT&T 48 state challenge for the Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
tsp_brute, a Fortran77 code which is given a city location table, and solves a (small) traveling salesperson problem (TSP), using brute force. Graphics files are created for processing by gnuplot().
tsp_display, a Fortran77 code which displays the solution of a Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().