PARTITION_PROBLEM is a FORTRAN77 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 FORTRAN77 version and a MATLAB version.
COMBINATION_LOCK, a FORTRAN77 program which simulates the process of determining the secret combination of a lock.
COMBO, a FORTRAN90 library which includes many combinatorial routines.
KNAPSACK, a FORTRAN77 library which solves a variety of knapsack problems.
LAMP, a FORTRAN77 library which solves linear assignment and matching problems.
LAU_NP, a FORTRAN90 library which implements heuristic algorithms for various NP-hard combinatorial problems.
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 FORTRAN77 program which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
SUBSET, a FORTRAN77 library which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.
SUBSET_SUM, a FORTRAN77 library which seeks solutions of the subset sum problem.
SUBSET_SUM_TASKS, a MATLAB program which runs in parallel, seeking solutions of the subset sum problem. Instructions are available on how to run the job, via MATLAB's BATCH facility, on a remote system such as Virginia Tech's ITHACA cluster.
You can go up one level to the FORTRAN77 source codes.