Revision as of 15:01, 13 July 2006 edit Nils Grimsmo (talk \| contribs) 567 edits More spesific running time ← Previous edit		Revision as of 18:58, 14 July 2006 edit undo 84.220.61.33 (talk) →Bibliography Next edit →
Line 81: * Harold W. Kuhn, "Variants of the Hungarian method for assignment problems", ''Naval Research Logistic Quarterly'', '''3''': 253-258, 1956. * J. Munkres, "Algorithms for the Assignment and Transportation Problems", ''[[Journal of the Society of Industrial and Applied Mathematics]]'', '''5'''(1):32-38, 1957 March. * M. Fischetti, "Lezioni di Ricerca Operativa", Edizioni Libreria Progetto Padova, Italia, 1995. * R. Ahuja, T. Magnanti, J. Orlin, "Network Flows", Prentice Hall, 1993. ==External links==

Hungarian algorithm: Difference between revisions