Knapsack problem

Version 1.0.0.0 (1.91 KB) by Hanan Kavitz
A well known combinatorial problem
3.8
(4)
3.7K Downloads
Updated 20 Mar 2012

View License

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most useful items.

Cite As

Hanan Kavitz (2026). Knapsack problem (https://www.mathworks.com/matlabcentral/fileexchange/35753-knapsack-problem), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2012a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Version Published Release Notes
1.0.0.0