tsp_brute


tsp_brute, an Octave code which solves small versions of the traveling salesman problem, 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
      

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

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.

Related Data and Programs:

tsp_brute_test

closest_pair_brute, an Octave 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, an Octave code which uses brute force to solve small versions of the 0/1 knapsack problem;

matrix_chain_brute, an Octave code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.

octave_combinatorics, an Octave code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.

partition_brute, an Octave 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, an Octave 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, an Octave 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.

Reference:

  1. Gerhard Reinelt,
    TSPLIB - A Traveling Salesman Problem Library,
    ORSA Journal on Computing,
    Volume 3, Number 4, Fall 1991, pages 376-384.

Source Code:


Last revised on 30 September 2022.