.png){kind=icon}
返回
Mathematical models and decomposition methods for the multiple knapsack problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2018.10.043.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the multiple knapsack problem, that calls for the optimal assignment of a set of items, each having a profit and a weight, to a set of knapsacks, each having a maximum capacity. The problem has relevant managerial implications and is known to be very difficult to solve in practice for instances of realistic size. We review the main results from the literature, including a classical mathematical model and a number of improvement techniques. We then present two new pseudo-polynomial formulations, together with specifically tailored decomposition algorithms to tackle the practical difficulty of the problem. Extensive computational experiments show the effectiveness of the proposed approaches. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Multiple knapsack problem
Exact algorithms
Pseudo-polynomial formulations
Decomposition methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Bin packing and cutting stock problems: Mathematical models and exact algorithms装箱和切割库存问题: 数学模型和精确算法
PREAI
分享收藏分享收藏
查看更多内容