搜索资源列表
multiplechoiceknapsack
- 关于多选择背包的很好的文章，提供了各种设计思路-Multiple Choice Knapsack Problem Example of planning choice in transportation
2
- 基于背包和椭圆曲线的代理数字签名方案。结合椭圆曲线数字签名方案和变形的背包问题，提出了一种改进的椭国曲线数字签名 方案.-Backpack and the elliptic curve based on the proxy digital signature scheme. Combination of elliptic curve digital signature scheme and deformation of the knapsack problem, put forward an
0-1bag
- 解决0-1背包问题的几种方法，有回溯，有优先分支界限，是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report
4.KNAPSACK
- Implement 0/1 Knapsack problem using dynamic programming
package
- 采用动态规划思想解决0-1背包问题，更好的理解动态规划思想，理解递归的理念- It uses dynamic programming to solve the 0-1 knapsack problem, a better understanding of dynamic programming, understanding the concept of recursion
knapsack
- Development of a heuristic for the Knapsack problem