partition_brute, a MATLAB code which uses brute force to seek solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
The information on this web page is distributed under the MIT license.
partition_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.
closest_pair_brute, a MATLAB 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 MATLAB code which uses brute force to solve small versions of the 0/1 knapsack problem;
matlab_combinatorics, a MATLAB code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
matrix_chain_brute, a MATLAB code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.
satisfy_brute, a MATLAB 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 MATLAB 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_brute, a MATLAB code which is given a city-to-city distance table, and solves a (small) traveling salesperson problem (TSP), using brute force.