摘要
解极小化的指派问题常用匈牙利解法 ,但我们从指派问题的数学模型的特征中发现 ,它还可以采用解运输问题的表上作业法去求解 ,文中通过实例说明其解法 ,并且可以看出这种解法与匈牙利方法一样简单方便。
The Hungarian Merhod is usually used in solving assignment problems of the least cost. However, we have found out from the characteristics of mathemetical model of assignment problems that the operation method on the table as in solving frasportation problems could also be applied in the field. In this paper, the author tries to illustrate the solution by examples and demonstrate that the method is as slmple as the Hungarian one.
出处
《运筹与管理》
CSCD
2000年第1期64-68,共5页
Operations Research and Management Science
关键词
极小化
指派问题
表上作业法
the least cost
assignment problem
the operation method on the table
examples