.png){kind=icon}
返回
Algorithmic approaches to the multiple knapsack assignment problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.omega.2018.11.013.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a variant of the multiple knapsack problem in which some assignment-type side constraints have to be satisfied. The problem finds applications in logistics sectors related, e.g., to transportation and maritime shipping. We derive upper bounds from Lagrangian and surrogate relaxations of a mathematical model of the problem. We introduce a constructive heuristic and a metaheuristic refinement. We study the computational complexity of the proposed methods and evaluate their practical performance through extensive computational experiments on benchmarks from the literature and on new sets of randomly generated instances. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Multiple knapsack problem
Assignment problem
Relaxations
Heuristic algorithms
Computational experiments
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.8K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容