Solution of Large-sized Quadratic Knapsack Problems Through Aggressive Reduction

  title={Solution of Large-sized Quadratic Knapsack Problems Through Aggressive Reduction},
  author={David Pisinger and Anders Bo Rasmussen and Rune Sandvik},
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint. All coefficients are assumed to be nonnegative and all decision variables are binary. A new exact algorithm is presented, which makes use of aggressive reduction techniques to decrease the size of the instance to a manageable size. A cascade of upper bounds is used for the reduction, including an improved version of the Caprara-Pisinger-Toth bound based on upper planes and… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 18 references

Kvaliteten af grænseværdier for det kvadratiske knapsack problem, 2002

A. B. Rasmussen, R. Sandvik
Project 02-09-7, • 2002
View 4 Excerpts
Highly Influenced

A new upper bound for the 0-1 quadratic knapsack problem

European Journal of Operational Research • 1999
View 7 Excerpts
Highly Influenced

Tour Merging via Branch-Decomposition

INFORMS Journal on Computing • 2003
View 1 Excerpt

Efficient methods for solving quadratic 0-1 knapsack problems

P. L. Hammer, D. J. Rader
INFOR, 35:170–182 • 1997
View 1 Excerpt


C. E. Ferreira
Martin, C.C. de Souza, R. Weismantel, and L.A. Wolsey. Formulations and valid inequalities for node capacitated graph partitioning. Mathematical Programming, 74:247–266 • 1996
View 1 Excerpt

An extended formulation approach to the edge-weighted maximal clique problem

K. Park, K. Lee, S. Park
European Journal of Operational Research, 95:671–682 • 1996
View 1 Excerpt

Similar Papers

Loading similar papers…