Revision as of 21:57, 27 July 2022 edit 2620:15c:53:200:2f56:eef7:385c:f879 (talk) Remove a broken link. Tag: Visual edit ← Previous edit		Revision as of 00:59, 29 August 2022 edit undo Leopd (talk \| contribs) 105 edits →Matrix interpretation: Removing confusing tag as the key issue has been addressed in that the matrix interpretation has been clearly described. Also this explanation is vastly clearer than the bipartite graph version. Tags: Mobile edit Mobile web edit Next edit →
Line 87: ==Matrix interpretation== {{Confusing\|reason=this performs the algorithm on an example, but the actual algorithm for matrices was never discussed before, and does not provide details of the actual algorithm, and also relies on vague approaches such as "drawing" a minimum cover.\|date=November 2019}} Given {{mvar\|n}} workers and tasks, and an {{mvar\|n}}×{{mvar\|n}} matrix containing the cost of assigning each worker to a task, find the cost minimizing assignment.

Hungarian algorithm: Difference between revisions