对分配问题求解方法的改进

Improvement in Solution to the Allocation Problem

用匈牙利算法求解分配问题过程中，需要确定已变换后的系数矩阵中０元素的最大分配。目前０元素的最大分配是应用求网络最大流的方法求出的。提出了１种更为简便、快捷的方法即最小０元素消耗数方法来确定０元素的最大分配。

In the solving process of the allocation problem with the Hungarian method,it is necessary to determine the maximum allocation of zero elements of the transformed coefficient matrix. The present way to determine the maximum allocation of zero elememts comes from the principle of maximum flow of network. In this paper,a superior method is presented to find the maximun allocation of zero elements. The method,called the Least Zero Consumption Method,is simple,practical,and efficient.