PARTITION_PROBLEM
The Partition Problem

PARTITION_PROBLEM is a MATLAB library which seeks 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_PROBLEM is available in a C version and a C++ version and a FORTRAN90 version and a FORTRAN77 version and a MATLAB version.

Related Data and Programs:

COMBINATION_LOCK, a MATLAB program which simulates the process of determining the secret combination of a lock.

COMBO, a MATLAB library which includes many combinatorial routines.

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

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

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

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.
• timestamp.m prints the current YMDHMS date as a time stamp.

Examples and Tests:

• partition_problem_test.m, calls all the tests.
• partition_problem_test01.m, tests partition_brute();
• partition_problem_test02.m, tests partition_count();
• partition_problem_test_output.txt, the output file.

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