.png){kind=icon}
返回
The nonlinear knapsack problem - algorithms and applications
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00179-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a survey of algorithms and applications for the nonlinear knapsack problem (or, the nonlinear resource allocation problem). In its most general form, the nonlinear knapsack problem will be defined as a nonlinear optimization problem with just one constraint, bounds on the variables, and, in some cases, a set of specially structured constraints such as generalized upper bounds (GUBs). This problem is encountered either directly, or as a subproblem, in a variety of applications, including production planning, financial modeling, stratified sampling, and capacity planning in manufacturing, health care, and computer networks. By taking advantage of the special structure of the problem, efficient solution methods can be developed. Problem classes addressed here include continuous and integer problems, convex and nonconvex problems, separable and nonseparable problems, and problems with additional specially structured constraints. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
nonlinear knapsack problems
nonlinear resource allocation problem
nonlinear programming
integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。