Revision as of 09:23, 29 September 2022 edit 136.36.225.23 (talk) →Step 2: task 1 is done efficiently by agent a, but the issue in the assignment implied by this matrix seems to be between agents c and d (since it isn't apparent that they are fit for any other tasks) Tags: Mobile edit Mobile web edit ← Previous edit		Revision as of 21:55, 1 October 2022 edit undo PlasticStylus (talk \| contribs) 65 edits →External links: Changed link to point to a Research Gate copy of the course notes. Tag: Visual edit Next edit →
Line 298: * Mordecai J. Golin, [http://www.cse.ust.hk/~golin/COMP572/Notes/Matching.pdf Bipartite Matching and the Hungarian Method] (bigraph formalism), Course Notes, [[Hong Kong University of Science and Technology]]. [https://brilliant.org/wiki/hungarian-matching Hungarian maximum matching algorithm] (both formalisms), in Brilliant website. [[R. A. Pilgrim]], ''[~~http~~https://~~csclab~~www.~~murraystate~~researchgate.~~edu~~net/~~bob.pilgrim~~publication/~~445/munkres.html~~290437481_Tutorial_on_Implementation_of_Munkres'_Assignment_Algorithm Munkres' Assignment Algorithm. Modified for Rectangular Matrices]'', Course notes, [[Murray State University]]. * [[Mike Dawes]], ''[https://web.archive.org/web/20060812030313/http://www.math.uwo.ca/~mdawes/courses/344/kuhn-munkres.pdf The Optimal Assignment Problem]'', Course notes, [[University of Western Ontario]]. * [http://www.cs.elte.hu/egres/tr/egres-04-14.pdf On Kuhn's Hungarian Method – A tribute from Hungary], [[András Frank]], Egervary Research Group, Pazmany P. setany 1/C, H1117, Budapest, Hungary.

Hungarian algorithm: Difference between revisions