tsp_display, a C++ code which displays the solution of a Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
The information on this web page is distributed under the MIT license.
tsp_display is available in a C version and a C++ version and a Fortran90 version.
concorde, examples which call concorde(), which solves the traveling salesman problem (TSP), mixed integer programming, and related network optimization problems.
cpp_combinatorics, a C++ code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
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_brute, a C++ code which is given a city-to-city distance table, and solves a (small) traveling salesperson problem (TSP), using brute force.
tsp_nearest, a C++ code which is given a city-to-city distance table, and solves a small traveling salesperson problem (TSP) using the nearest neighbor algorithm. It picks a starting city at random, and then successively visits the nearest unvisited city.