.png){kind=icon}
返回
The quadratic knapsack problem with setup
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2024.106873.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Quadratic Knapsack Problem is a well-known generalization of the classical 0-1 knapsack problem, in which any pair of items produces a pairwise profit if both are selected. Another relevant generalization of the knapsack problem is the Knapsack Problem with Setup, in which the items are partitioned into classes, the items of a class can only be inserted into the knapsack if the corresponding class is activated, and activating a class involves a setup cost and a setup capacity reduction. Despite a rich literature on these two problems, their obvious generalization, i.e., the Quadratic Knapsack Problem with Setup, was never investigated so far. We discuss applications, mathematical models, deterministic matheuristic algorithms, and computationally evaluate their performance.
Keyword:
Quadratic knapsack problem
Setup constraints
Matheuristic algorithms
Local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
分享收藏Natural products as the calcium channel blockers for the treatment of arrhythmia: Advance and prospect.png)
Fitoterapia
FitoterapiaIF0
PREAI
分享收藏
查看更多内容