递归思想在指派问题中的运用  

Application of Recursive Idea in Assignment Problem

作　　者：周志辉[1] 刘建生[1] 

机构地区：[1]江西理工大学理学院,江西341000

出　　处：《现代计算机》2010年第2期45-47,共3页Modern Computer

摘　　要：提出将矩阵进一步缩小的方法来求指派问题的解,用匈牙利解法求指派问题的解,然后用递归思想求解指派问题,并对两种方法的优缺点进行比较。通过对比可以知道,两种方法所得的结果是一样的。匈牙利算法的优点是算法时间复杂度较小,缺点是解题过程比较复杂。递归思想的优点是解题过程比较简单,缺点是算法时间复杂度较大。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, the disadvantage is that the time complexity algorithm is larger.

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

分 类 号：O221[理学—运筹学与控制论] TP301.6[理学—数学]