算法设计报告，有5种算法，动态规划，贪心法，回溯法，递归，分支界限法

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

分支界限费用矩阵的说明文档，非常实用,建议下载哦-Branch line cost matrix documentation, very practical, it is recommended to download Oh