搜索资源列表
hungry
- 用匈牙利算法解决二部图的最优匹配问题,可用于多任务的指派问题的解决.-Hungary algorithm used to solve the two plans optimal matching can be used for many tasks assigned to resolve the problem.
hungury
- 用编程来实现匈牙利算法，主要解决指派问题，有兴趣的下来看看。-Hungary used to achieve programming algorithm, mainly to solve the assignment problem, interested to see it.
AssignmentProblem
- 指派问题的匈牙利算法，用C语言编写，效果良好-Assignment Problem Soving
Hungary
- 匈牙利算法求解指派问题，能够求解大规模的指派问题，经过不同规模问题的测试均无问题。-Hungarian algorithm for assignment problem that can be assigned to solve large-scale problems, the scale of the problem through different tests no problem.
Assignment-Problem
- 能解决运筹学指派问题,采用窗体的表现形式，利用匈牙利算法进行求解-Operations research assignment problem can be solved using the form manifestation by the Hungarian algorithm to solve
fp
- 指派问题的匈牙利算法，基本算法实现。 Hungarian algorithm for assignment problem(Hungarian algorithm for assignment problem)