Article ID: | iaor20063662 |
Country: | Netherlands |
Volume: | 16 |
Issue: | 2 |
Start Page Number: | 188 |
End Page Number: | 197 |
Publication Date: | Mar 2004 |
Journal: | INFORMS Journal On Computing |
Authors: | Billionnet Alain, Soutif ric |
Keywords: | programming: integer, programming: branch and bound |
In this paper we will consider the 0–1 quadratic knapsack problem (QKP). Our purpose is to show that using a linear reformulation of this problem and a standard mixed integer programming tool, it is possible to solve the QKP efficiently in terms of computation time and the size of problems considered, in comparison to existing methods. Considering a problem involving