搜索资源列表
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
01packet
- 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
suanfa
- 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem