摘要
分派问题是运筹学中一类具有实用价值的问题。本文在分析“匈牙利算法”的基础上,提出了解决这类问题的一种实用算法——对角线法。这种算法思路清晰,过程简单,占用内存空间少,便于计算机求解。
Assignment problem has practical values in operations research. Based upon the analysis of Hungary Algorithm, this paper proposes a practical algorithm, i.e. a diagohal algorithm, to solve this problem. This algorithm is clear, simple and occupies less computer's internal storage space
出处
《山东矿业学院学报》
CAS
1993年第3期240-244,共5页
Journal of Shandong University of Science and Technology(Natural Science)
关键词
分派问题
对角线法
匈牙利算法
assignment problem
diagnol
algorithm
efficiency matrix
