subset_sum_backtrack, a Fortran90 code which uses backtracking to find solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum..
The information on this web page is distributed under the MIT license.
subset_sum_backtrack 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_dynamic, a Fortran90 code which uses dynamic programming to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.
knapsack_01, a Fortran90 code which uses brute force to solve small versions of the 0/1 knapsack problem;
lau_np, a Fortran90 code which implements heuristic algorithms for various NP-hard combinatorial problems.
partition_problem, a Fortran90 code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
satisfy, a Fortran90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
subset_sum, a Fortran90 library which seeks solutions of the subset sum problem.
subset_sum_brute, a Fortran90 code which uses brute force to solve the subset sum problem, to find a subset of a set of integers which has a given sum.
tsp_brute, a Fortran90 code which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.