.png){kind=icon}
返回
Heuristic and exact algorithms for the simultaneous assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00100-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The simultaneous assignment problem is formulated as an extension to the assignment problem. The problem is proved, NP-hard. We evaluate its lower bound and present some approximate algorithms. Also we introduce the pegging test to this problem and show that this remarkably reduces the size of the original problem. Combining these we give an algorithm to solve the problem to optimality, and through numerical tests analyze the behavior of the developed algorithms. Randomly generated test problems with up to 48 000 variables are solved in less than a few minutes. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
simultaneous assignment problem
local search
pegging test
combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
