Knapsack problem

Versione 1.0.0.0 (1,91 KB) da Hanan Kavitz
A well known combinatorial problem
3.8
(4)
3,7K download
Aggiornato 20 mar 2012

Visualizza la licenza

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.

Cita come

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

Compatibilità della release di MATLAB
Creato con R2012a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!

Versione Pubblicato Note della release
1.0.0.0