.png){kind=icon}
返回
An algorithm for ranking assignments using reoptimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2007.04.008.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Its computational performance is compared with all available implementations of algorithms with the same time complexity. The results are encouraging. (c) 2007 Elsevier Ltd. All rights reserved.
Keyword:
linear assignment problem
ranking
K best solutions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications煅烧温度对射频溅射制备的CZTS吸收层性能的影响OAAI
OAAI分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏
分享收藏
查看更多内容