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 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.
The most common problem being solved is the 0-1 knapsack problem, which restricts the number xi of copies of each kind of item to zero or one. An item 'i' is entirely inside the knapsack or it is not.
Latest Version
1.1Uploaded by
Ton To
Requires Android
Android 4.0.3+
Category
Free Education AppContent Rating
Everyone
Report
Flag as inappropriateLast updated on Dec 26, 2016
- Translation to Portuguese
- Some bugs fixed
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.
