partition_brute

partition_brute, a MATLAB code which uses brute force to seek solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

Licensing:

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

Languages:

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

partition_brute_test

change_making, a MATLAB code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.

combination_lock, a MATLAB code which simulates the process of determining the secret combination of a lock.

combo, a MATLAB code which includes many combinatorial routines.

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

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

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

tsp_brute, a MATLAB code which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.

Reference:

1. Alexander Dewdney,
   The Turing Omnibus,
   Freeman, 1989,
   ISBN13: 9780716781547,
   LC: QA76.D45.
2. Brian Hayes,
   The Easiest Hard Problem,
   American Scientist,
   Volume 90, Number 2, March-April 2002, pages 113-117.
3. Silvano Martello, Paolo Toth,
   Knapsack Problems: Algorithms and Computer Implementations,
   Wiley, 1990,
   ISBN: 0-471-92420-2,
   LC: QA267.7.M37.

Source Code:

• partition_brute.m approaches the partition problem using brute force.
• partition_count.m counts the solutions to a partition problem.
• subset_next.m computes the subset lexicographic successor.