PARTITION_PROBLEM
The Partition Problem


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

Related Data and Programs:

KNAPSACK_01, a Python library which uses brute force to solve small versions of the 0/1 knapsack problem;

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

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

SUBSET_SUM, a Python library which seeks solutions of the subset sum problem, in which it is desired to find a subset of a set of integers which has a given sum.

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:

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


Last revised on 10 November 2015.