A projection method for the integer quadratic knapsack problem

A projection method for the integer quadratic knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor1997698
Country: United Kingdom
Volume: 47
Issue: 3
Start Page Number: 457
End Page Number: 462
Publication Date: Mar 1996
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: knapsack problem
Abstract:

This paper presents 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, the paper first presents modifications to a projection method for solving the continuous subproblems. Then it implements the modified projection method in a branch and bound framework and reports computational results indicating that the new branch and bound algorithm is superior to the earlier method.

Reviews

Required fields are marked *. Your email address will not be published.