01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt

解决0-1背包问题的几种方法，有回溯，有优先分支界限，是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report

0_1背包问题的分支定界法算法 希望帮到大家-0_1 branch and bound method for the knapsack problem algorithm