Welcome![Sign In][Sign Up]
Location:
Search - 01knapsack

Search list

[Other resource01knapsack

Description: 01背包问题的C++源程序,写的比较简单
Platform: | Size: 2945 | Author: sandy chen | Hits:

[Other resource01knapsack

Description: MPI 并行编程 一维0/1口袋问题 动态规划 求优化解
Platform: | Size: 2234 | Author: sangecoa | Hits:

[Data structs01knapsack

Description: 01背包问题的C++源程序,写的比较简单-01 knapsack problem C++ Source code, written in relatively simple
Platform: | Size: 49152 | Author: sandy chen | Hits:

[MPI01knapsack

Description: MPI 并行编程 一维0/1口袋问题 动态规划 求优化解-MPI parallel programming one-dimensional 0/1 pocket of the problem of dynamic programming for optimal solution
Platform: | Size: 2048 | Author: sangecoa | Hits:

[Mathimatics-Numerical algorithms01Knapsack

Description: 贪心法0-1背包问题贪 心法0-1背包问题-0/1Knapsack problem greedy Method
Platform: | Size: 1024 | Author: xnn | Hits:

[Data structs01knapsack

Description: 01背包动态规划法的cpp文件 直接可用-01 knapsack dynamic programming
Platform: | Size: 1024 | Author: 荆博 | Hits:

[Data structs01knapsack

Description: 运用动态规划实现01背包的问题,c++编写,值得学习-01knapsack,Dynamic programming
Platform: | Size: 5957632 | Author: 李宏伟 | Hits:

[Other01knapsack

Description: 01背包和完全背包的讲解,包含实现代码:一维数组形式和二维数组形式的两种实现-01 backpack and full backpack explain, including the code: two implementations of one-dimensional array of forms and two-dimensional array form
Platform: | Size: 15360 | Author: gubusun | Hits:

[JSP/JavaKnapsack

Description: 很经典的01背包以及分数背包问题的解决方案,分别用了动态规划以及递归的思想!-01Knapsack and fractional Knapsack in java
Platform: | Size: 1024 | Author: 刘磊 | Hits:

CodeBus www.codebus.net