**knapsack_01**,
a Python code which
uses brute force to solve small versions of the 0/1 knapsack problem.

In the 0/1 knapsack problem, we are given a knapsack with carrying capacity C, and a set of N items, with the I-th item having a weight of W(I). We want to pack as much total weight as possible into the knapsack without exceeding the weight limit. We do this by specifying which items we will not take (0) or take (1).

This code uses a simple brute force or exhaustive search method, which is guaranteed to get the optimal solution, but which is not efficient for large values of N.

The computer code and data files described and made available on this web page are distributed under the MIT license

**knapsack_01** 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 dataset directory which contains test data for the 0/1 knapsack problem;

partition_problem, a Python code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

satisfy, a Python code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

subset, a Python code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.

subset_sum, a Python code 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.

- knapsack_01.py, the source code.
- knapsack_01.sh, runs all the tests.
- knapsack_01.txt, the output file.