About 0-1 Knapsack Problem Solver
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.
Download and install
0-1 Knapsack Problem Solver version 1.1 on your
Android device!
Downloaded 100+ times, content rating: Everyone
Android package:
com.klimaco.knapsackproblem, download 0-1 Knapsack Problem Solver.apk
by Q####:
Gives wrong answers. Please debug the app, else take it down from the playstore.