搜索资源列表
vc1011423523562
- 运筹学之指派问题的匈牙利算法。 运筹学上的一个经典算法-tacticians Zhi assignment of the Hungarian algorithm. Tacticians on a classical algorithm
zhipaiwenti
- 运筹学之指派问题的匈牙利算法。刚刚才看到的，不错哦-tacticians Zhi assignment of the Hungarian algorithm. Only just to see, oh well
xiongyalisuanfa
- 指派问题的匈牙利算法,用于指派n个问题给m个人的最优解-assignment of the Hungarian algorithm for assignment n m personal problems to the optimal solution
12345
- 指派问题的匈牙利算法（matlab语言）-assignment of the Hungarian algorithm (Matlab language)
xiongyalisuanfa
- 此程序，用vc++源代码实现了指派问题的匈牙利算法，
fenpei
- 匈牙利算法的m文件，是指派问题的最优解法，只要输入相关矩阵，便可以得到最佳分配问题
cvery
- 利用C++语言解决指派问题的匈牙利算法，最大化指派双方的收益-The assignment problem is solved by Hungarian algorithm used Visual C++，maximum the two sides gains.
MATLAB
- 利用MATLAB解决了指派问题的匈牙利算法-The assignment problem is solved by Hungarian algorithm used MATLAB
1011423523562
- 有关统计学的运筹学之指派问题的匈牙利算法。-Operational research on the statistics of the assignment problem of Hungary algorithm.
ap
- 在计算经典的模糊指派问题中比较实用的一种匈牙利算法，-In the calculation of the classic fuzzy assignment problem in Hungary as a more practical algorithm,
xiongyalisuanfa
- 匈牙利算法是求解指派问题的多项式时间算法
0-1fenpei
- 本程序是用来解决0-1规划问题的，匈牙利算法的MATLAB程序（用以解决分配（指派）问题） 本程序的用法是：输入效率矩阵 marix 为方阵，调用自编指令[z,ans]=fenpei(marix) 输出z为最优解，ans为最优分配矩阵。-This procedure usage is: input efficiency marix phalanx, calls for matrix maozhi instructions, [z] = fenpei (ans marix) output z
TWO-PART-ALGORITHM-BASED-JAVA
- 本程序是指派问题的匈牙利算法.采用Excel的后台VBA 程序来解决.下面就给出全部的代码。 -This program is the Hungarian Assignment algorithm. Using Excel VBA program to solve the background. Here, give all of the code.
qddown_vc1011423523562
- 指派问题的匈牙利算法 指派问题的匈牙利算法-Hungarian Assignment algorithm Hungarian algorithm assignment problem
Hungary-algorithm
- 用来求解指派问题的匈牙利算法，比目前网上流传的运行效果都好。-Hungary algorithm
nokAssignment
- 指派问题非匈牙利算法,用matlab编的,不是原创 不错的-Assignment problem the Hungary algorithm and matlab compiled, the original is not good
jmvsjt
- 指派问题非匈牙利算法,用matlab编的,不是原创 不错的-Assignment problem the Hungary algorithm and matlab compiled, the original is not good
maxassignment
- 实现指派问题的最大赋权，利用匈牙利算法实现0-1最大值规划。(The maximum empowerment of the assignment problem)
iohig1
- 有关统计学的运筹学之指派问题的匈牙利算法,()
hungary
- 程序实现了匈牙利算法应用于指派问题，输入指派成本矩阵C，给出最小成本及使得成本最小的最优指派(Input the assignment cost matrix C, the program will obtain the least cost and the optimal assignment vector.)