Abstract: This paper has improved on the multi-branch-and-bound algorithm for 0-1 knapsack problems¹.The method uses one state space tree to describe the solution space of the problem.A new concept,fictitious knapsack,is given to simplify counting the upper bound function.This improved algorithm can solve 0-1 knapsack problems with more than one knapsack efficiently.