中文说明：用分支定界算法解决整数规划问题，通过分支，定界，剪枝不断的缩小搜索范围，最后找出整数解。其中变量个数可以通过随机产生，涉及到0-1背包问题，该算法是整数规划中的经典案例
English Description：
The branch and bound algorithm is used to solve the integer programming problem. Through the branch, bound and pruning, the search scope is continuously reduced, and the integer solution is finally found. The number of variables can be generated randomly, which involves 0-1 knapsack problem. This algorithm is a classic case in integer programming