搜索资源列表
指派问题
- 自己作的指派问题 不好意思 主要用于运筹学的指派问题-themselves to the assignment of major embarrassment for the assignment of tacticians
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
指派问题
- 指派问题在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.
qapdata.tar
- 组合优化问题中的二次指派问题的Marcbenk
qapsoln.tar
- 组合优化问题中二次指派问题解决方案，适用于各种平台
yunchouxue.rar
- 运筹学ppt考试复习专用 第一章 线性规划与单纯形法 第二章 线性规划的对偶理论 第三章 整数规划 第四章 目标规划 第五章 运输与指派问题 第六章 网络模型,Operational research ppt exam review chapter dedicated linear programming and simplex method chapter on linear programming duality theory of integer programmi
hungury
- 用编程来实现匈牙利算法，主要解决指派问题，有兴趣的下来看看。-Hungary used to achieve programming algorithm, mainly to solve the assignment problem, interested to see it.
AssignmentProblem
- 指派问题的匈牙利算法，用C语言编写，效果良好-Assignment Problem Soving
Assignment
- 本系统可应用于运输支配、工程分包、工作分配等一系列指派问题 本系统也适用于人多事少、事多人少、一人多做事等一系列指派问题-This system can be applied to transport control, engineering, subcontracting, work assignments and a series of assignment of the system also applies to people eventful few things few peop
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.
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)
AssignmentSolution
- 指派问题的拍卖算法，广义拍卖算法 指派问题的拍卖算法，广义拍卖算法(auction algorithm for assignment problem)