.png){kind=icon}
返回
A new upper bound for the multiple knapsack problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105210.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a Bounded Sequential Multiple Knapsack Problem, i.e., a multiple knapsack problem in which item sizes are divisible. Such a relaxation, called sequential relaxation, is obtained by suitably replacing the items of a MKP instance with items with divisible sizes. Experimental results on benchmark instances show that the upper bound is effective, in terms of quality, when the ratio between the number of items and the number of knapsacks is small. (C) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Multiple Knapsack Problem
Sequential relaxation
Upper bound
Divisible sizes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Severe dysplasminogenemia due to homozygous PLG Ala620Thr variant in a Korean woman without a history of venous thromboembolism一名无静脉血栓栓塞史的女性韩国人，由于纯合子PLG Ala620Thr变异导致严重低纤溶酶原血症.png)
Medicine
OAAI
MedicineIF0
OAAI分享收藏分享收藏
查看更多内容