.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Multiple Knapsack Problem
Sequential relaxation
Upper bound
Divisible sizes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
Severe dysplasminogenemia due to homozygous PLG Ala620Thr variant in a Korean woman without a history of venous thromboembolism.png)
Medicine
OAAI
MedicineIF0
OAAIShareSaveShareSaveShareSave
View more