tsp_brute, a Fortran77 code which is given a table of city locations, and solves small versions of the traveling salesman problem (TSP), using brute force.
The information on this web page is distributed under the MIT license.
tsp_brute 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.
change_making, a Fortran77 code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
cities, a Fortran90 code which handles various problems associated with a set of "cities" on a map.
combination_lock, a Fortran77 code which simulates the process of determining the secret combination of a lock.
knapsack_01, a Fortran77 code which uses brute force to solve small versions of the 0/1 knapsack problem;
partition_problem, a Fortran77 code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
satisfy, a Fortran77 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
subset_sum, a Fortran77 code which seeks solutions of the subset sum problem.
tsp, a dataset directory which contains test data for the traveling salesperson problem;
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_display, a Fortran77 code which displays the solution of a Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().