分支界限算法 ，用队列解决最优装载问题，跟背包算法有同样的功能-Branch and bound algorithm, the optimal loading queue to resolve the problem, with the same functionality Knapsack Algorithm