.png){kind=icon}
返回
An exact algorithm for large multiple knapsack problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00120-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total profit sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as financial management. A new exact algorithm for the MKP is presented, which is specially designed for solving large problem instances. The recursive branch-and-bound algorithm applies surrogate relaxation for deriving upper bounds, while lower bounds are obtained by splitting the surrogate solution into the m knapsacks by solving a series of Subset-sum Problems. A new separable dynamic programming algorithm is presented for the solution of Subset-sum Problems, and we also use this algorithm for tightening the capacity constraints in order to obtain better upper bounds. The developed algorithm is compared to the MTM algorithm by Martello and Toth, shelving the benefits of the new approach. A surprising result is that large instances with n = 100 000 items may be solved in less than a second, and the algorithm has a stable performance even for instances with coefficients in a moderately large range. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
integer programming
knapsack problem
loading
dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
没有更多内容
没有更多内容