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

递归思想在指派问题中的运用
引用本文:周志辉,刘建生.递归思想在指派问题中的运用[J].现代计算机,2010(2):45-47.
作者姓名:周志辉  刘建生
作者单位:江西理工大学理学院,江西,341000 
摘    要:提出将矩阵进一步缩小的方法来求指派问题的解,用匈牙利解法求指派问题的解,然后用递归思想求解指派问题,并对两种方法的优缺点进行比较.通过对比可以知道,两种方法所得的结果是一样的.匈牙利算法的优点是算法时问复杂度较小,缺点是解题过程比较复杂.递归思想的优点是解题过程比较简单,缺点是算法时间复杂度较大.

关 键 词:指派问题  匈牙利算法  递归思想  最小值

Application of Recursive Idea in Assignment Problem
ZHOU Zhi-hui,LIU Jian-sheng.Application of Recursive Idea in Assignment Problem[J].Modem Computer,2010(2):45-47.
Authors:ZHOU Zhi-hui  LIU Jian-sheng
Affiliation:ZHOU Zhi-hui,LIU Jian-sheng(College of Science,Jiangxi University of Science , Technology,Jiangxi 341000)
Abstract:Proposes to further reduce the matrix approach to seek the solution of assignment problem,uses the Hungarian method to solve assignment problem,uses recursive idea to solve assignment problem,compares the advantages and disadvantages of the two methods.By contrast can know the results of both methods is the same.Hungarian algorithm has the advantage of small time complexity,the disadvantage of more complex problem-solving process.The advantage of recursive idea problem-solving process is relatively simple,t...
Keywords:Assignment Problem  Hungarian Algorithm  Recursive Idea  Min Value  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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