Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 38, Issue 2, Pages 505-513Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.07.010
Keywords
Nonlinear knapsack; Nonconvexity; Separable knapsack; Heuristic; Local search; Mixed integer nonlinear programming
Categories
Funding
- Ministero dell'Istruzione, dell'Universita e della Ricerca (MIUR), Italy
Ask authors/readers for more resources
We consider the nonlinear knapsack problem with separable nonconvex functions. Depending on the assumption on the integrality of the variables, this problem can be modeled as a nonlinear programming or as a (mixed) integer nonlinear programming problem. In both cases, this class of problems is very difficult to solve, both from a theoretical and a practical viewpoint. We propose a fast heuristic algorithm, and a local search post-optimization procedure. A series of computational comparisons with a heuristic method for general nonconvex mixed integer nonlinear programming and with global optimization methods shows that the proposed algorithms provide high-quality solutions within very short computing times. (C) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available