| 指派问题的一种改进算法 |
| |
| 引用本文： | 金升灿.指派问题的一种改进算法[J].佳木斯大学学报,1998(1). |
| |
| 作者姓名： | 金升灿 |
| |
| 作者单位： | 佳木斯大学 |
| |
| 摘 要： | 指出了用于解指派问题的匈牙利算法并不是很完善的，并给出了匈牙利算法的修改和改进的算法．
|
| 关 键 词： | 最大匹配 算法 覆盖 |
THE CHANGED ALGORITHM OF SOLVING ASSIGNMENT PROBLEM |
| |
| Jin Shengcan.THE CHANGED ALGORITHM OF SOLVING ASSIGNMENT PROBLEM[J].Journal of Jiamusi University(Natural Science Edition),1998(1). |
| |
| Authors: | Jin Shengcan |
| |
| Institution: | Jiamusi University 154007 |
| |
| Abstract: | In this paper we devised the Hungrian algorithm of solving assignmentproblem is not always right. then we raised the changed algorithm. |
| |
| Keywords: | the best assignment algorithm cover |
| 本文献已被 CNKI 等数据库收录！ |
