# subset_sum

subset_sum, a Python code which seeks solutions of the subset sum problem.

SUBSET_SUM_NEXT works by backtracking, returning all possible solutions one at a time, keeping track of the selected weights using a 0/1 mask vector of size N.

SUBSET_SUM_TABLE works by a kind of dynamic programming approach, constructing a table of all possible sums from 1 to S. The storage required is N * S, so for large S this can be an issue.

SUBSET_SUM_FIND works by brute force, trying every possible subset to see if it sums to the desired value. It uses the bits of a 32 bit integer to keep track of the possibilities, and hence cannot work with more N = 31 weights.

### Languages:

subset_sum is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

### Related Data and Programs:

knapsack_01, a Python code which uses brute force to solve small versions of the 0/1 knapsack problem;

partition_problem, a Python code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

satisfy, a Python code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

subset, a Python code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.

subset_sum, a dataset directory which contains examples of the subset sum problem, in which a set of numbers is given, and is desired to find at least one subset that sums to a given target value.

### Reference:

1. Alexander Dewdney,
The Turing Omnibus,
Freeman, 1989,
ISBN13: 9780716781547,
LC: QA76.D45.
2. Donald Kreher, Douglas Simpson,
Combinatorial Algorithms,
CRC Press, 1998,
ISBN: 0-8493-3988-X,
LC: QA164.K73.
3. Silvano Martello, Paolo Toth,
Knapsack Problems: Algorithms and Computer Implementations,
Wiley, 1990,
ISBN: 0-471-92420-2,
LC: QA267.7.M37.