Knapsack problem

Version 1.0.0.0 (1,91 KB) von Hanan Kavitz
A well known combinatorial problem
3.8
(4)
3,7K Downloads
Aktualisiert 20. Mär 2012

Lizenz anzeigen

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.

Zitieren als

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

Kompatibilität der MATLAB-Version
Erstellt mit R2012a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Kategorien
Mehr zu Particle Swarm finden Sie in Help Center und MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Veröffentlicht Versionshinweise
1.0.0.0