**tsp_greedy_test**,
a MATLAB code which
calls tsp_greedy(), which
applies a simple greedy algorithm to construct a solution to the
traveling salesman problem.

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

tsp_greedy, a MATLAB code which applies a simple greedy algorithm to construct a solution to the traveling salesman problem.

- tsp_greedy_test.m, calls all the tests.
- tsp_greedy_test.sh, runs all the tests.
- tsp_greedy_test.txt, the output file.

- five.txt, a 5 city distance matrix, whose minimal tour has length 19.
- fifteen.txt, a 15 city distance matrix, whose minimal tour has length 291.
- fortyeight.txt, a 48 city distance matrix, whose minimal tour has length 33523.
- seventeen.txt, a 17 city distance matrix, whose minimal tour has length 2,085.