jburkardt

PARTITION_PROBLEM\ The Partition Problem {#partition_problem-the-partition-problem align=”center”} =====================

---

PARTITION_PROBLEM is a C++ library which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

Licensing: {#licensing align=”center”}

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

Languages: {#languages align=”center”}

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: {#related-data-and-programs align=”center”}

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

COMBO, a C++ library which includes many combinatorial routines.

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

PARTITION_PROBLEM, a dataset directory which contains examples of the partition problem, in which a set of numbers is given, and it is desired to break the set into two subsets with equal sum.

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

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

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

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

Reference: {#reference align=”center”}

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: {#source-code align=”center”}

• partition_problem.cpp, the source code.
• partition_problem.hpp, the include file.

Examples and Tests: {#examples-and-tests align=”center”}

• partition_problem_prb.cpp, a sample calling program.
• partition_problem_prb_output.txt, the output file.

List of Routines: {#list-of-routines align=”center”}

• I4_ABS returns the absolute value of an I4.
• I4VEC_COPY copies an I4VEC.
• I4VEC_DOT_PRODUCT computes the dot product of two I4VEC’s.
• I4VEC_SUM sums the entries of an I4VEC.
• PARTITION_BRUTE approaches the partition problem using brute force.
• PARTITION_COUNT counts the solutions to a partition problem.
• SUBSET_NEXT computes the subset lexicographic successor.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the C++ source codes.

---

Last revised on 12 May 2012.