On a discrete nonlinear and nonseparable knapsack problem

On a discrete nonlinear and nonseparable knapsack problem

0.00 Avg rating0 Votes
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:
Keywords: knapsack problem
Abstract:

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(n) time. This algorithm forms the basis for a branch-and-bound algorithm, which is subsequently used to test the efficacy of a proposed heuristic. Computational results are presented.

Reviews

Required fields are marked *. Your email address will not be published.