The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number 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 valuable items.
http://en.wikipedia.org/wiki/Knapsack_problem
Basically, its a solver for a variation of this problem, the knapsack 0/1 problem
Dernière version
1Telechargé par
Adam Dresbach
Nécessite Android
Android 2.3.2+
Catégories
Gratuit Enseignement APPLICATIONClassification du contenu
Everyone
Signaler
Signaler comme inappropriéLast updated on Apr 24, 2018
Cette version comprend des corrections de bugs mineurs et des améliorations générales. Installez la dernière version pour profiter d’une expérience optimale.