Journal of Heuristics

, Volume 19, Issue 4, pp 573–589

Quadratic bottleneck knapsack problems



In this paper we study the quadratic bottleneck knapsack problem (QBKP) from an algorithmic point of view. QBKP is shown to be NP-hard and it does not admit polynomial time ϵ-approximation algorithms for any ϵ>0 (unless P=NP). We then provide exact and heuristic algorithms to solve the problem and also identify polynomially solvable special cases. Results of extensive computational experiments are reported which show that our algorithms can solve QBKP of reasonably large size and produce good quality solutions very quickly. Several variations of QBKP are also discussed.


Quadratic Knapsack problem Bottleneck Quadratic threshold Semi-greedy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of MathematicsSimon Fraser University SurreySurreyCanada

Personalised recommendations