PARTITION_PROBLEM is a Python library 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 GNU LGPL 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.
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.
You can go up one level to the Python source codes.