Knapsack problem

Versión 1.0.0.0 (1,91 KB) por Hanan Kavitz
A well known combinatorial problem
3.8
(4)
3,7K descargas
Actualizado 20 mar 2012

Ver licencia

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.

Citar como

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

Compatibilidad con la versión de MATLAB
Se creó con R2012a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Particle Swarm en Help Center y MATLAB Answers.

Community Treasure Hunt

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

Start Hunting!

Versión Publicado Notas de la versión
1.0.0.0