subset_sum_brute_test

subset_sum_brute_test, an Octave code which calls subset_sum_brute(), which illustrates how a subset sum problem can be solved by exhaustive search.

Licensing:

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

Related Data and Programs:

subset_sum_brute, an Octave code which seeks solutions of the subset sum problem, in which it is desired to find a subset of a set of integers which has a given sum; this version of the program is intended as a starting point for a parallel approach.

Source Code:

• subset_sum_brute_test.m, calls all tests.
• subset_sum_brute_test.sh, runs all tests.
• subset_sum_brute_test.txt, the output file.

• subset_sum_brute_test01.m, solves a problem involving 21 weights.