搜索资源列表
optimizebackpack
- 背包问题c算法实现,利用回溯法实现的背包问题详解,内附源代码即详细注解,以及一些优化的思想,很容易理解,是一个很好的算法,通过调试,可以运行。-knapsack problem c algorithm, using the retrospective method to achieve Hi knapsack problem, the source code that contains detailed notes, and some optimization thinking, it is e
testskpkgenerte
- 随机生成超递增背包序列的方法,c语言实现 如有什么问题,请与sendtofl@yahoo.com.cn联系
linux4
- linux下的MPI的C语言程序,包括背包问题的源代码和结果-MPI under linux C-language program, including the knapsack problem of the source code and results
bag
- 分支限界法解决0/1背包问题,用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
01beibao
- 使用VC编程工具,C语言实现动态规划算法解决01背包问题-Using the VC programming tool, C language implementation 01 knapsack problem solving dynamic programming algorithm
packet
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题-used the c++ for parket problem