Exact Solution of the Quadratic Knapsack Problem


The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coeecients are assumed to be nonnegative and all variables are binary. The problem has applications in location and hydrology, and generalizes the problem of checking whether a graph contains a clique of a given size. We… (More)
DOI: 10.1287/ijoc.11.2.125


Cite this paper

@article{Caprara1999ExactSO, title={Exact Solution of the Quadratic Knapsack Problem}, author={Alberto Caprara and David Pisinger and Paolo Toth}, journal={INFORMS Journal on Computing}, year={1999}, volume={11}, pages={125-137} }