File Exchange

image thumbnail

Knapsack problem

version 1.0 (1.91 KB) by

A well known combinatorial problem

3 Ratings



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.

Comments and Ratings (3)


reala (view profile)

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
MATLAB 7.14 (R2012a)

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video