| 在求解指派问题的匈牙利法中划最少覆盖线的一种新方法 |
| |
| 引用本文： | 宁宣熙
,李宁.在求解指派问题的匈牙利法中划最少覆盖线的一种新方法[J].南京航空航天大学学报,1988(4). |
| |
| 作者姓名： | 宁宣熙 李宁 |
| |
| 摘 要： | 本文提出了一种在求解指派问题的匈牙利法中如何划最少覆盖线的方法。该方法可以简化迭代步骤,其计算机程序较易实现。
|
| 关 键 词： | 线性规划 分配问题 计算机应用 |
A New Algorithm of Drawing Covering Line in Hungary's Method for Assignment Problem |
| |
| Ning Xuanxu Li Ning.A New Algorithm of Drawing Covering Line in Hungary''''s Method for Assignment Problem[J].Journal of Nanjing University of Aeronautics & Astronautics,1988(4). |
| |
| Authors: | Ning Xuanxu Li Ning |
| |
| Institution: | Ning Xuanxu Li Ning |
| |
| Abstract: | This paper presents a new method to draw the covering line in solving assignment problems. By this new algorithm the procedure of Hungary's method can be simplified and easily developed into computer programs. |
| |
| Keywords: | linear programming assignment problem computer application |
| 本文献已被 CNKI 等数据库收录！ |
