.png){kind=icon}
返回
A library for continuous convex separable quadratic knapsack problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2013.02.038.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Continuous Convex Separable Quadratic Knapsack problem (CQKnP) is an easy but useful model that has very many different applications. Although the problem can be solved quickly, it must typically be solved very many times within approaches to (much) more difficult models; hence an efficient solution approach is required. We present and discuss a small open-source library for its solution that we have recently developed and distributed. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Quadratic programming
Continuous Nonlinear Resource Allocation Problem
Lagrangian relaxation
Optimization software
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
.png){kind=icon}
