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
Latest Version
1Uploaded by
Adam Dresbach
Requires Android
Android 2.3.2+
Category
Free Education AppContent Rating
Everyone
Report
Flag as inappropriateLast updated on Apr 24, 2018
This release includes minor bug fixes and general improvements. Update to the latest version for the best experience.
APKPure - A multi-platform app store primarily focused on Android, providing extensive app-related content. Discover the app you want easier, faster, and safer, with quick and efficient downloads and installations.
