.png){kind=icon}
.png){kind=icon}
Return
Heuristic algorithms for the general nonlinear separable knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2010.07.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Nonlinear knapsack
Nonconvexity
Separable knapsack
Heuristic
Local search
Mixed integer nonlinear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W