Article ID: | iaor1991715 |
Country: | Netherlands |
Volume: | 9 |
Issue: | 4 |
Start Page Number: | 233 |
End Page Number: | 237 |
Publication Date: | Jul 1990 |
Journal: | Operations Research Letters |
Authors: | Klastorin T.D. |
Keywords: | knapsack problem |
In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), the paper shows how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O(