partition_problem, a C code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
The computer code and data files described and made available on this web page are distributed under the MIT license
partition_problem is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
CHANGE_MAKING, a C code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
COMBO, a C code which includes many combinatorial routines.
COMBINATION_LOCK, a C code which simulates the process of determining the secret combination of a lock.
KNAPSACK_01, a C code 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 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
SUBSET, a C code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.
SUBSET_SUM, a C code which seeks solutions of the subset sum problem.
TSP_BRUTE, a C code which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.