knapsack_random, an Octave code which randomly chooses a subset of N items, each with given value and weight. It then evaluates whether this is a feasible solution to a problem in which a thief's knapsack can carry no more than Wmax pounds, and it is desired to maximum the total value of the selected items.
The information on this web page is distributed under the MIT license.
knapsack_random 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.
octave_combinatorics, an Octave code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.