Journal of the Operational Research Society

, Volume 47, Issue 3, pp 457–462 | Cite as

A Projection Method for the Integer Quadratic Knapsack Problem

  • Kurt M. Bretthauer
  • Bala Shetty
  • Siddhartha Syam
Technical Note

Abstract

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.

Keywords

Integer Programming Quadratic Knapsack Problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Operational Research Society 1996

Authors and Affiliations

  • Kurt M. Bretthauer
    • 1
  • Bala Shetty
    • 1
  • Siddhartha Syam
    • 2
  1. 1.Texas A&M University
  2. 2.Marquette UniversityUSA

Personalised recommendations