partition_brute, a Fortran77 code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
The information on this web page is distributed under the MIT license.
partition_brute is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
change_making, a Fortran77 library which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
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.
KNAPSACK_01, a Fortran77 library which uses brute force to solve small versions of the 0/1 knapsack problem;
LAMP, a Fortran77 library which solves linear assignment and matching problems.
partition_brute, 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.
TSP_BRUTE, a Fortran77 program which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.