PARTITION_PROBLEM
The Partition Problem

PARTITION_PROBLEM, 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 MATLAB version and a Python version.

Related Data and Programs:

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

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.

partition_problem_test

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.

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

Reference:

Alexander Dewdney,
The Turing Omnibus,
Freeman, 1989,
ISBN13: 9780716781547,
LC: QA76.D45.
Brian Hayes,
The Easiest Hard Problem,
American Scientist,
Volume 90, Number 2, March-April 2002, pages 113-117.
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.