Mengenai Knapsack Problem
its a solver
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
Maklumat APLIKASI tambahan
Versi Terbaru
1Dimuat naik oleh
Adam Dresbach
Memerlukan Android
Android 2.3.2+
Category
PERCUMA Pendidikan APLIKASIPenilaian Kandungan
Everyone
Laporkan
Tandai sebagai tidak sesuaiApa yang baru dalam versi terkini 1
Last updated on Apr 24, 2018
Versi ini mengandungi pembaikan pepijat kecil dan penambahbaikan umum. Kemas kini kepada versi terkini untuk pengalaman terbaik.
Knapsack Problem Tangkapan skrin
Versi lama Knapsack Problem
265.6 KBApr 24, 2018
