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
En Son Sürüm
1Yükleyen
Adam Dresbach
Gereken Android sürümü
Android 2.3.2+
Kategori
Ücretsiz Eğitim UYGULAMAİçerik derecelendirmesi
Everyone
Bildir
Uygunsuz olarak işaretleLast updated on Apr 24, 2018
Bu sürümde küçük hata düzeltmeleri ve genel iyileştirmeler bulunur. En iyi deneyim için en yeni sürüme güncelleyin.