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.
Versi Terbaru
1.1Dimuat naik oleh
Ton To
Memerlukan Android
Android 4.0.3+
Category
PERCUMA Pendidikan APLIKASIPenilaian Kandungan
Everyone
Laporkan
Tandai sebagai tidak sesuaiLast updated on Dec 26, 2016
- Translation to Portuguese
- Some bugs fixed
APKPure - Sebuah gedung aplikasi berbilang platform yang tertumpu terutamanya pada Android, menyediakan kandungan berkaitan aplikasi yang meluas. Temui aplikasi yang anda mahukan dengan lebih mudah, pantas, dan selamat, dengan muat turun dan pemasangan yang cepat dan cekap.
