文件名称:Knapsack-problem
介绍说明－－下载内容均来自于网络，请自行研究使用
假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。-Suppose a total volume of T can be packed into a backpack and n pieces of volume, respectively w1, w2, ..., wn items, items can be selected from n number of pieces is just filled with backpacks, even if w1+ w2+ ...+ wn = T, required to find all the solutions to meet the above conditions.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
背包问题
........\build.xml
........\manifest.mf
........\build
........\.....\classes
........\.....\.......\beibao.class
........\.....\.......\bubbleSort.class
........\nbproject
........\.........\build-impl.xml
........\.........\genfiles.properties
........\.........\project.properties
........\.........\project.xml
........\.........\private
........\.........\.......\private.properties
........\src
........\...\beibao.java
........\...\bubbleSort.java
........\test
........\build.xml
........\manifest.mf
........\build
........\.....\classes
........\.....\.......\beibao.class
........\.....\.......\bubbleSort.class
........\nbproject
........\.........\build-impl.xml
........\.........\genfiles.properties
........\.........\project.properties
........\.........\project.xml
........\.........\private
........\.........\.......\private.properties
........\src
........\...\beibao.java
........\...\bubbleSort.java
........\test