匈牙利算法是解决指派问题的一种非常简单有效的方法。
Hungarian algorithm is a very simple but efficient way to solve assignment problems.
文中对匈牙利算法的起源、运用、求解模型及其原理作了介绍。
The origin of Hungarian algorithm, its application, the solution model as well as its principle will be introduced in this article.
创造性地将匈牙利算法运用到指纹匹配过程中，取得了良好的效果。
The Hungary algorithm is used in the matching processing which does good effect.
而对于人员数多于任务数的指派问题文中给出的求解方法是类匈牙利算法。
Based on this method and Hungarian algorithm, the article offers a solution to the multi-objectives decision problem — personnel with ability restriction and personnel fewer than assignment "."
用匈牙利算法求解分配问题过程中，需要确定已变换后的系数矩阵中0元素的最大分配。
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 scheduling problem can be transformed into assignment problem, and the optimization solution can be obtained by Hungarian algorithm.
本文采用了以目标类型为主要属性的威胁评估方法，然后运用匈牙利算法对得到的威胁矩阵进行目标分配。
This paper presents a way using target type as the main property to evaluate threat degree, and using Hungarian algorithm to solve the targets assignment problem.
分析了经典的匈牙利算法存在的缺点，结合代价矩阵的特点，提出了求解分配问题的一种新的算法——差额法。
After analyzing disadvantage of the classic Hungary method, a new method, maximum difference method, is presented to solve the assignment problem considering the characteristics of cost matrix.
最后，基于帮助对象的选取原则和匈牙利算法，对该问题最优化算法进行了具体描述，计算实例表明该算法是有效的。
Finally, based on the rules and Hungary algorithm, the optimization algorithm is described in detail, which is proven effective by the given example.
通过增添虚拟工序和元素替代等手段，将不平衡问题变为平衡问题，运用“匈牙利算法”得到选配结果，重复匹配过程，可以得到多条工艺路线。
The matching of process with equipments can be changed into assignment problem by adding dummy process and replacing element. Repeating matching in this way, many routes of process can be obtained.
通过对人力资源优化配置问题的讨论，给出了将该问题转化成求最大匹配问题的方法；通过用匈牙利算法求解对应的匹配问题，得出该资源分配问题的最优解。
Through the discussion of the optimum disposition of human resources, a method is proposed to transform the problem of the optimal match into the maximal match.
此外，两名匈牙利计算机科学家最近又向其中增加了一种一流的手法使得该运算法则能够在不损耗速度的前提下集中关注最可能的棋路。
Moreover, two Hungarian computer scientists have recently added an elegant twist that allows the algorithm to focus on the most promising moves without sacrificing speed.
本文对OR中的“指派问题”提出两个新的解法，它往往可避免“匈牙利方法”所引起的麻烦，且算法也较简便。
This paper gives two new solutions for the assignment problem of or, which can avoid the trouble caused by the "Hungary Method" sometimes and whose algorism is rather simple.
文章将重点提出竞争型指派问题的详细的算法—竞争型指派问题的匈牙利方法。
In this article, we emphatically provide the detailed algorithm of the competition assignment problem-the Hungarian method of the competition assignment problem.
采用蚁群算法解决了此问题，并通过实例给出了算法，并与匈牙利法做了比较，结果表明该方法比较有效。
An ant colony algorithm is put forward compared with Hungary method, and its effectiveness is illustrated through result.
采用蚁群算法解决了此问题，并通过实例给出了算法，并与匈牙利法做了比较，结果表明该方法比较有效。
An ant colony algorithm is put forward compared with Hungary method, and its effectiveness is illustrated through result.
应用推荐