搜索资源列表
指派问题
- 自己作的指派问题 不好意思 主要用于运筹学的指派问题-themselves to the assignment of major embarrassment for the assignment of tacticians
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
assignment_problem
- 某单位需要完成N项任务,恰好有N个人可承担这些任务。由于每人的专长不同,个人完成任务不同,所需成本也不同。若第i个人完成第将j项任务的成本为C(i,j),问题是如何分配这些工作任务,使总成本最小? 这类问题为指派问题。-units required to complete a certain task N, N just a personal commitment of these tasks. As the expertise of different individuals to com
0-1programming
- 0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。另:胡运权所著的《运筹学基础及应用(第三版)》第97页的例3,我用本程序求解得到的结果是:最优解是x*=(1,0, 0, 0, 0),最优值是f(x*)=8,但书求得最优解是x*=(1,0, 1, 0, 0),最优值是f(x*)=4,是不是书中写错
指派问题
- 指派问题在LINGO下的程序!-assigned LINGO in the process!
hungry
- 用匈牙利算法解决二部图的最优匹配问题,可用于多任务的指派问题的解决.-Hungary algorithm used to solve the two plans optimal matching can be used for many tasks assigned to resolve the problem.
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,
AssignmentProblem
- 指派问题的匈牙利算法,用C语言编写,效果良好-Assignment Problem Soving
munkres
- 指派问题的匈牙利解法,从文件中读入待指派的数据。-Assignment problem of the Hungarian method, read from a file to be assigned to data.
zhipai2
- 指派问题 微粒群PSO算法优化 带绘图 优化目标为工作质量-Assignment of particle swarm optimization PSO algorithm to optimize the drawing target with the quality of work
Assignmentproblem
- 指派问题:里面包含有三个函数和一个主函数-Assignment problem: which contains the three functions and a main function
fp
- 指派问题的匈牙利算法,基本算法实现。 Hungarian algorithm for assignment problem(Hungarian algorithm for assignment problem)
maxassignment
- 实现指派问题的最大赋权,利用匈牙利算法实现0-1最大值规划。(The maximum empowerment of the assignment problem)
指派问题
- 使用匈牙利算法来解决指派问题,MATLAB代码(The Hungarian algorithm solves the assignment problem)
sa
- 模拟退火算法实现工作指派问题求最优解,c++实现(Simulated annealing algorithm to achieve the work of the assignment problem for the optimal solution, c ++ implementation)
AssignmentSolution
- 指派问题的拍卖算法,广义拍卖算法 指派问题的拍卖算法,广义拍卖算法(auction algorithm for assignment problem)
hungary
- 程序实现了匈牙利算法应用于指派问题,输入指派成本矩阵C,给出最小成本及使得成本最小的最优指派(Input the assignment cost matrix C, the program will obtain the least cost and the optimal assignment vector.)