Article ID: | iaor2009544 |
Country: | Netherlands |
Volume: | 178 |
Issue: | 3 |
Start Page Number: | 738 |
End Page Number: | 754 |
Publication Date: | May 2007 |
Journal: | European Journal of Operational Research |
Authors: | Mathur Kamlesh, Venkateshan Prahalad |
Keywords: | programming: integer |
It is well known that the linear knapsack problem with general integer variables (LKP) is NP-hard. In this paper we first introduce a special case of this problem and develop an O(