论文部分内容阅读
目前国际上广泛用于求解指派问题的匈牙利法,其效率有待提高。对经过行列缩减的矩阵中零位相关情况和可指派零位缺额进行了分析。提出了有关可指派零位缺额的定理,并建议了效率较高的算法。
The current Hungarian law widely used to solve the assignment problem in the world needs to be improved in efficiency. An analysis of zero-related and zero-assignable gaps in matrices reduced by ranks was conducted. Proposed the theorem that can assign zero vacancies, and proposed a more efficient algorithm.