Combinatorial Optimization

Volume 12 of the series Mathematical Programming Studies pp 132-149


Quadratic knapsack problems

  • G. GalloAffiliated withIstituto M. Picone per le Applicazioni del Calcolo, CNR
  • , P. L. HammerAffiliated withUniversity of Waterloo
  • , B. SimeoneAffiliated withUniversity of Waterloo

* Final gross prices may vary according to local VAT.

Get Access


The quadratic knapsack (QK) model naturally arises in a variety of problems in operations research, statistics and combinatorics. Some “upper planes” for the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.

Key words

Knapsack Problem Quadratic Programming Upper Planes Branch-and-Bound Computation