期刊
COMPUTERS & OPERATIONS RESEARCH
卷 35, 期 11, 页码 3714-3726出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2007.04.008
关键词
linear assignment problem; ranking; K best solutions
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据