The general solution of the best answer to the assignment problem through more than one efficiency matrix.
介绍了多个效率矩阵的指派问题最优解的一般解法。
It's found that "Hungary arithmetic" in the assignment problem could not get convergence when dealing with special data, and could not obtain optimum result.
在处理一些特殊数据时，发现分配问题的“匈牙利法”并不收敛，无法得到最优解。
Then the assignment problem is illustrated with the directed acyclic graphs. The assignment problem becomes the partition problem of directed acyclic graphs.
接着把这一特殊的指派问题用有向无回路图表示出来，从而使指派问题的求解转化为求解有向无回路图的划分问题。
This paper gives two new solutions for the assignment problem of or, which can avoid the trouble caused by the "Hungary Method" sometimes and whose algorism is rather simple.
本文对OR中的“指派问题”提出两个新的解法，它往往可避免“匈牙利方法”所引起的麻烦，且算法也较简便。
We investigate a more practical assignment problem under fuzzy environment, that is, the elements of profit matrix and time matrix in the assignment problem are fuzzy variables.
研究了一类更加贴近于现实生活的模糊环境中的指派问题，即利润矩阵和时间矩阵中的元素均为模糊变量的指派问题。
After analyzing disadvantage of the classic Hungary method, a new method, maximum difference method, is presented to solve the assignment problem considering the characteristics of cost matrix.
分析了经典的匈牙利算法存在的缺点，结合代价矩阵的特点，提出了求解分配问题的一种新的算法——差额法。
The assignment problem is a kind of combinatorial optimization problems.
分配问题是一个组合优化问题。
The assignment problem is researched based on shortest path, merge path and appropriate diversion path.
基于最短径路、合并径路、适度分流径路三种径路形式研究铁路OD分配问题。
The assignment problem is researched based on shortest path, merge path and appropriate diversion path.
基于最短径路、合并径路、适度分流径路三种径路形式研究铁路OD分配问题。
应用推荐