tsp_brute, a C code which solves small versions of the traveling salesman problem (TSP), using brute force.
The user must prepare a file beforehand, containing the city-to-city distances. The program will request the name of this file, and then read it in. An example of such a file is:
0 3 4 2 7
3 0 4 6 3
4 4 0 5 8
2 6 5 0 6
7 3 8 6 0
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 Fortran90 version and a MATLAB version and an Octave version and a Python version.
change_dynamic, a C code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
closest_pair_brute, a C code which uses brute force to solve a 2D version of the closest pair problem, which identifies the closest pair of points in a given collection.
knapsack_01_brute, a C code which uses brute force to solve small versions of the 0/1 knapsack problem;
matrix_chain_brute, a C code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.
partition_brute, a C code which uses a brute force method to find solutions of the partition problem, in which a set of integers must be split into two subsets with equal sum.
satisfy_brute, a C code which uses brute force to find all assignments of values to a set of logical variables which make a complicated logical statement true.
subset_sum_brute, a C code which uses brute force to solve the subset sum problem, to find a subset of a set of integers which has a given sum.
tsp, a dataset directory which contains test data for the traveling salesperson problem;