匈牙利算法

仿真分析表明，使用改进的匈牙利算法确实可以提高整个CR网络的归一化吞吐量。

Simulation results show that the improved Hungarian algorithm can greatly improve the overall normalized throughput comparing with the random channel selection method .

本论文详细讨论了匈牙利算法的理论根据以及正确实现匈牙利算法的方法，并给出了具体的MATLAB程序，经过大量的数值试验表明该程序是快速有效的。

This dissertation also discusses the fundamental theory of the Hungarian algorithm for the assignment problem in detail and , and give a correct realization algorithm and its MATLAB routine . The routine is efficient and reliable under a great number of numerical tests .

为了解决以上问题，我们用匈牙利算法（Hungary）实现了多智能体系统的任务分配。

To solve the problem above , we use the Hungary algorithm to realize the task allocation problem .

很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。本资料包含了Floyd、prim、匈牙利算法等算法-Graphalgorithms。

Many problems can be transformed into graph theory problems , and then use the basic algorithm of graph theory to solve them .

在该算法中，eNB为不同用户选择不同预编码方案，并采用改进的匈牙利算法得出最优选择。

The algorithm achieves its goal by selecting different precoding schemes for different users and gets solution through modified Hungarian algorithm .

用改进的匈牙利算法实现粗粒度的子任务调度

Fulfilling the Rough Granularity Scheduling of Subtasks with Improved Hungary Algorithm

用匈牙利算法计算置换的漂移分布

Computing the shift distribution of a permutation using the hungarian method

多目标广义指派问题的模糊匈牙利算法求解

Fuzzy Hungary algorithm for solving the multiobject generalized assignment problem

匈牙利算法在检查搜潜兵力指派问题中的应用

Application of Hungarian Algorithm to the Forces Assignment in Anti-submarine Inspection Searching

匈牙利算法与分枝定界法解决调色问题之比较

Comparison of Color Solution via Hungarian Algorithm and Branch-and-bound Method

基于匈牙利算法的多车型车辆调度问题

Study of Multi-type Vehicle Scheduling Problem based on Hungary Algorithm

匈牙利算法是图论中完成二分图匹配的经典算法之一。

Hungary algorithm is a classical one to solve bipartite graph matching problem .

匈牙利算法在多目标分配中的应用

An Application of Hungarian Algorithm to the Multi-Target Assignment

基于匈牙利算法的关键设备优化配置技术

Optimal Match of Key Equipment Based on Hungary Algorithm MATCH POINT Match Arrangement

改进的匈牙利算法在小组软件过程中的应用

Applying an improved Hungary Algorithm to personal software process

基于模糊匈牙利算法的炮兵火力单位分配问题

Artillery Fire Units Distribution Based on Fuzzy Hungarian Method

基于匈牙利算法的高速动车组周转模型及算法的研究

Research on the model and algorithm of high-speed train-set scheduling based on Hungary algorithm

创造性地将匈牙利算法运用到指纹匹配过程中，取得了良好的效果。

The Hungary algorithm is used in the matching processing which does good effect .

模糊匈牙利算法在舰艇抢修人员指派问题中的研究

Research on Fuzzy Hungary Algorithm in the Problem of Maintenance Personnel Assignment in Warships

仿真结果表明匈牙利算法对于此类多目标分配指派问题的求解是十分有效的。

Result shows that the Hungarian algorithm is an effective method for solving the assignment problem .

对匈牙利算法的改进及其应用实例

Improving Hungary Algorithm and Its Application

匈牙利算法质疑

A Query on Hungarian Algorithms

为了减少列车在折返站的耗费时间，采用匈牙利算法对时刻表进行周转方案优化。

In order to reduce the time consuming , using the Hungarian algorithm to optimize the timetable .

然后利用匈牙利算法进行中继子载波对选择；

Based on this , a subcarrier pair selection method is given by applying the Hungarian algorithm .

另外，设计了以匈牙利算法为核心的启发式算法求解该优化模型。

In addition , a heuristic algorithm based on the Hungarian algorithm is developed to compute the model .

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

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

将考虑上述影响因素的任务分配问题转化为求解标准匈牙利算法问题，并探讨了非标准问题的求解。

Changed the task allocation problem which considered factors above all to the standard Hungary algorithm question and discussed nonstandard task allocation problem .

指派问题是运筹学中的一个重要问题，它的一个快速的多项式算法就是著名的匈牙利算法。

The assignment problem is important in the Operational Research . A fast polynomial algorithm is the famous so called " Hungarian algorithm " .

对于高效求解大规模尤其是人数与任务数不一致的指派问题，匈牙利算法存在一些不足之处。

When solving large scale assignment problem , especially when solving an asymmetrical one or efficiency is critical , Hungarian algorithm is not competent enough .

本文把这个问题抽象成一个指派问题，采用匈牙利算法和进化算法结合的方法。

In this paper , the problem is abstracted as a Assignment Problem and solved by a method based on Hungarian algorithm and evolutionary algorithm .