期刊
COMPUTERS & OPERATIONS RESEARCH
卷 38, 期 2, 页码 505-513出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.07.010
关键词
Nonlinear knapsack; Nonconvexity; Separable knapsack; Heuristic; Local search; Mixed integer nonlinear programming
类别
资金
- Ministero dell'Istruzione, dell'Universita e della Ricerca (MIUR), Italy
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据