SUBSET_SUM_SERIAL
Solve a Subset Sum Problem by Exhaustive Search

SUBSET_SUM_SERIAL is a MATLAB library which illustrates how a subset sum problem can be solved by exhaustive search.

We are given a collection of (21) weights and a target value (24639098). We seek a combination of the weights which adds up to the target value.

The function subset_sum_serial.m simply considers every possible subset of the weights, determines its sum, and compares that to the target value. The first case in which the target value is matched is returned as the solution.

This program, which solves the problem serially, is primarily intended to be a starting point for a parallel programming approach.

Licensing:

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

Related Data and Programs:

SATISFY, a MATLAB program which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

SUBSET_SUM, a MATLAB library which seeks solutions of the subset sum problem.

SUBSET_SUM_TASKS, a MATLAB program which solves the subset sum problem by exhaustive search, dividing the problem into subtasks, each of which is carried out as a separate program.

Reference:

• 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_serial.m, seeks a solution of the subset sum problem by exhaustive search.
• timestamp.m prints the YMDHMS date as a timestamp.

Examples and Tests:

• subset_sum_serial_test.m, calls all tests.
• subset_sum_serial_test01.m, solves a problem involving 21 weights.
• subset_sum_serial_test_output.txt, the output file.

You can go up one level to the MATLAB source codes.