In the paper un upper bound for the complexity of solving the subset sum problem by the Branch-and-Bound method with the decomposition along the free variable with the maximal weight is obtained. This bound can be easily derived from the input data of the problem. So this bound allows to preliminarily estimate the computational resources required for solving the subset sum problem by the Branch-and-Bound method.

knapsack problems, Branch-and-Bound method; computational complexity

Mathematical problems and theory of numerical methods