搜索资源列表
yunchouxue.rar
- 运筹学ppt考试复习专用 第一章 线性规划与单纯形法 第二章 线性规划的对偶理论 第三章 整数规划 第四章 目标规划 第五章 运输与指派问题 第六章 网络模型,Operational research ppt exam review chapter dedicated linear programming and simplex method chapter on linear programming duality theory of integer programmi
SA
- 遗传算法用于指派问题，，，，非常的实用，可用于学习遗传算法编程的人参考-Genetic algorithms for assignment problem,,,, very practical, can be used to study genetic algorithm programming Reference
Hamilton
- 基于降度算法的哈密尔顿最优圈搜寻方法,寻找费用最小的哈密尔顿路径，用于解决TSP、任务分流、任务指派等问题-Find the best Hamilton route based on the method of lap down algorithm. The algorithm finds the minimum cost path for solving TSP, the task diversion, task assignment and other issues
2_1
- 匈牙利算法解决任务指派问题，即把n个任务指派给n个人要求成本最低。-Hungarian algorithm to solve the task assignment problem, namely the n tasks assigned to n individual requirements lowest cost.
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.
fp
- 指派问题的匈牙利算法，基本算法实现。 Hungarian algorithm for assignment problem(Hungarian algorithm for assignment problem)
AssignmentSolution
- 指派问题的拍卖算法，广义拍卖算法 指派问题的拍卖算法，广义拍卖算法(auction algorithm for assignment problem)