subset_sum

subset_sum_backtrack, an Octave code which uses backtracking to seek solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum.

Licensing:

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

Languages:

subset_sum_backtrack 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:

subset_sum_test

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

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.

Source Code:

• subset_sum_backtrack.m, seeks a subset of a set that has a given sum, using a backtracking approach and a mask vector.