File Exchange

image thumbnail

Knapsack problem

version (1.91 KB) by Hanan Kavitz
A well known combinatorial problem


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 (2021). Knapsack problem (, MATLAB Central File Exchange. Retrieved .

Comments and Ratings (4)



Thank you for your file.
I am working with a variable capacity and resolving for each of its value the knapsack algorithm with Dynmic programming.
I would like to know how can I, at the end of the resolution, find the best value of the capacity that gvies the optimal solution of the Knapsack.
Thank you in advance.

Andrew Newell

This is really a tutorial. It would be better to turn it into a script, with better explanations, and publish it. Also, in the pie charts the title writes over a couple of the numbers, making it a barely readable mess.

Mr Smart

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

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!