用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith

该代码为遗传算法以及两个实例，背包问题和旅行商问题，每个实例均有三组数据写在代码中，运行时将不需要的数据注释掉即可。-The source is about generic algorithm, including two examples, the knapsack problem and the traveling salesman problem.

求解背包问题 从根目录下的systemconfig.ini文件获取数据 结果以图表方式显示-To solve the knapsack problem Get data from systemconfig.ini at root directory Results display in graph