Revision as of 18:58, 14 July 2006 edit 84.220.61.33 (talk) →Bibliography ← Previous edit		Revision as of 18:58, 14 July 2006 edit undo 84.220.61.33 (talk) →Bibliography Next edit →
Line 77: From the elements that are left, find the lowest value. Subtract this from all elements that are not struck. Add this to elements that are present at the intersection of two lines. Leave other elements unchanged. Now assign the tasks using above rules. Repeat the procedure till an assignment is possible. ==~~Bibliography~~Bibliografía== * Harold W. Kuhn, "The Hungarian Method for the assignment problem", ''[[Naval Research Logistic Quarterly]]'', '''2''':83-97, 1955. Kuhn's original publication. * Harold W. Kuhn, "Variants of the Hungarian method for assignment problems", ''Naval Research Logistic Quarterly'', '''3''': 253-258, 1956.

Hungarian algorithm: Difference between revisions