首页 | 本学科首页   官方微博 | 高级检索  
     

解读“匈牙利法”——对《“匈牙利法”存在的问题及改进方法》一文的质疑
引用本文:张玉叶.解读“匈牙利法”——对《“匈牙利法”存在的问题及改进方法》一文的质疑[J].计算机时代,2011(10):1-4.
作者姓名:张玉叶
作者单位:济南职业学院计算机系,山东济南,250014
摘    要:“匈牙利法”是目前为止被人们认为求解指派问题最简单有效的方法,但有些人对此算法认识不全面,产生了一些误解。文章详细解读了“匈牙利法”及其求解步骤,并通过两个实例详细演示了“匈牙利法”的具体求解过程,以助学习者更好地理解和运用“匈牙利法”来解决实际问题,同时也澄清了对“匈牙利法”的某些错误认识。为保证求解结果的正确性,利用Excel提供的“规划求解”模块对求解结果进行了验证。

关 键 词:匈牙利法  指派问题  算法  规划求解

An Interpretation of Hungarian Algorithm——Question about Article Existing Problem and Improvement of Hungarian Algorithm
ZHANG Yu-ye.An Interpretation of Hungarian Algorithm——Question about Article Existing Problem and Improvement of Hungarian Algorithm[J].Computer Era,2011(10):1-4.
Authors:ZHANG Yu-ye
Affiliation:ZHANG Yu-ye(Dept.of Computer,Jinan Vocational College,Jinan,Shandong 250014,China)
Abstract:Hungarian algorithm is conceived to be the most simple and effective approach to solve assignment problem so far,but some people don't know it well enough to understand it correctly.We explain Hungarian algorithm in detail and its steps,and demonstrate its problem-solving process by two examples,so as to help learners to better understand and use Hungarian algorithm to solve practical problems,and clarify some misunderstandings about Hungarian algorithm.In order to ensure the correctness of results,the resu...
Keywords:Hungarian algorithm  assignment problem  algorithm  Programming Solver  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号