[1]杨光煜,张雷顺..对最大化指派问题的匈牙利解法的一点改进[J].郑州大学学报(工学版),2001,22(02):57-58,64.[doi:10.3969/j.issn.1671-6833.2001.02.017]
Yang Guangyu,Zhang Leishun.A little improvement over the Hungarian solution to the maximized assignment problem[J].Journal of Zhengzhou University (Engineering Science),2001,22(02):57-58,64.[doi:10.3969/j.issn.1671-6833.2001.02.017]
点击复制
对最大化指派问题的匈牙利解法的一点改进(
)
《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]
- 卷:
-
22
- 期数:
-
2001年02期
- 页码:
-
57-58,64
- 栏目:
-
- 出版日期:
-
1900-01-01
文章信息/Info
- Title:
-
A little improvement over the Hungarian solution to the maximized assignment problem
- 作者:
-
杨光煜; 张雷顺.
-
天津财经学院信息系,, 郑州工业大学水利与环境工程学院,
- Author(s):
-
Yang Guangyu; Zhang Leishun
-
-
- 关键词:
-
指派问题; 匈牙利解法; 改进
- Keywords:
-
- DOI:
-
10.3969/j.issn.1671-6833.2001.02.017
- 文献标志码:
-
A
- 摘要:
-
针对指派问题中最小化问题的匈牙利解法,提出一种不同于传统解法的最大化问题的求解方法.该方法不必一开始就去用新的系数矩阵代替原系数矩阵,而是可直接在原系数矩阵上进行求解,只是求解过程中的一些原则与最小化问题的求解原则有所不同.由于其解题步骤的多少与先后同最小化问题解题步骤的多少与先后是相对应的,所以可用同一段带系数的程序去解决最大化、最小化两个不同的问题.此方法简捷、直观,为计算机上解法的实现提供了方便途径.
- Abstract:
-
Aiming at the Hungarian solution of the minimization problem in the assignment problem, a solution method of maximizing the problem is proposed that is different from the traditional solution. This method does not need to replace the original coefficient matrix with a new coefficient matrix at the beginning, but can be solved directly on the original coefficient matrix, but some principles in the solution process are different from the solution principle of minimizing the problem. Since the number of problem-solving steps corresponds to the number of problem-solving steps and the number of problem-solving steps of the minimized problem, the same program with coefficients can be used to solve two different problems. This method is simple and intuitive, which provides a convenient way for the implementation of the solution on the computer.
更新日期/Last Update:
1900-01-01