Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Downloads SourceCode Mathimatics-Numerical algorithms
Title: Knapsack Download
 Description: 0-1背包 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
 Downloaders recently: [More information of uploader mizl2004]
 To Search: 0-1 knapsack knapsack Java
  • [knapsack] - 0-1 knapsack problem, a typical dynamic
File list (Check if you may need any files): 
Knapsack.java

CodeBus www.codebus.net