knapsack_dynamic, an Octave code which uses dynamic programming to solve a knapsack problem.
All the problem data, weights, values, and knapsack capacity, must be integers.
The information on this web page is distributed under the MIT license.
knapsack_dynamic is available in a MATLAB version and an Octave version and a Python version.
basketball_dynamic, an Octave code which uses dynamic programming to count the ways of achieving a given score in basketball, respecting the order of events.
octave_combinatorics, an Octave code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.