文件名称:Knapsack-problem
介绍说明－－下载内容均来自于网络，请自行研究使用
假设有一个能装入总重量为T的背包和n 件重量分别为W1，W2,W3,...,Wn的物品。编写算法从n件物品中挑选若干件恰好装满背包，即使得Wi1+Wi2+...+Win=T.(W旁边的字符皆为角标)。要求找出满足条件的所有解。-Suppose there is a load of T of the total weight of W1, N, W2, W3, Wn. Algorithm is compiled n items selected several pieces just loaded backpack, even if Wi1+Wi2+...+Win=T. (W beside the characters are all subscr ipt). All solutions are required to meet the requirements.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Knapsack problem.txt