全部

1·Hungarian algorithm is a very simple but efficient way to solve assignment problems.

匈牙利算法是解决指派问题的一种非常简单有效的方法。

2·The origin of Hungarian algorithm, its application, the solution model as well as its principle will be introduced in this article.

文中对匈牙利算法的起源、运用、求解模型及其原理作了介绍。

3·The scheduling problem can be transformed into assignment problem, and the optimization solution can be obtained by Hungarian algorithm.

首先建立了该类问题的数学模型，然后将其转化为指派问题，通过匈牙利算法可以得到最优解。

4·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.

本文采用了以目标类型为主要属性的威胁评估方法，然后运用匈牙利算法对得到的威胁矩阵进行目标分配。

5·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 .

而对于人员数多于任务数的指派问题文中给出的求解方法是类匈牙利算法。

6·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.

此外，两名匈牙利计算机科学家最近又向其中增加了一种一流的手法使得该运算法则能够在不损耗速度的前提下集中关注最可能的棋路。

7·In this article, we emphatically provide the detailed algorithm of the competition assignment problem-the Hungarian method of the competition assignment problem.

文章将重点提出竞争型指派问题的详细的算法—竞争型指派问题的匈牙利方法。