# subset_sum_brute

subset_sum_brute, a MATLAB code 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_brute.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.

### Languages:

subset_sum_brute is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version.

### Related Data and Programs:

fft_serial, a MATLAB code which demonstrates the computation of a fast fourier transform (fft), and is intended as a starting point for implementing a parallel version.

fire_simulation, a MATLAB code which simulates a forest fire over a rectangular array of trees, starting at a single random location. it is intended as a starting point for the development of a parallel version.

poisson, a MATLAB code which computes an approximate solution to the poisson equation in a rectangle, intended as the starting point for the creation of a parallel version.

prime, a MATLAB code which counts the number of primes between 1 and n, intended as a starting point for the creation of a parallel version.

quad, a MATLAB code which approximates an integral using a quadrature rule, and is intended as a starting point for parallelization exercises.

quad2d, a MATLAB code which approximates an integral over a 2d region using a product quadrature rule, and is intended as a starting point for parallelization exercises.

search_test, a MATLAB code which searches the integers from a to b for a value j such that f(j) = c. this version of the program is intended as a starting point for a parallel approach.

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

### Reference:

• Silvano Martello, Paolo Toth,
Knapsack Problems: Algorithms and Computer Implementations,
Wiley, 1990,
ISBN: 0-471-92420-2,
LC: QA267.7.M37.

### Source Code:

Last revised on 12 March 2019.