A Projection Method for the Integer Quadratic Knapsack Problem
提出一种新的分支定界算法求解整数二次背包问题，通过改进投影法求解连续子问题，计算表明新算法优于旧方法。
In this paper we present a new branch and bound algorithm for solving a class of integer quadratic knapsack problems. A previously published algorithm solves the continuous variable subproblems in the branch and bound tree by performing a binary search over the breakpoints of a piecewise linear equation resulting from the Kuhn-Tucker conditions. Here, we first present modifications to a projection method for solving the continuous subproblems. Then we implement the modified projection method in a branch and bound framework and report computational results indicating that the new branch and bound algorithm is superior to the earlier method.