Hungarian algorithm: Revision history

20 July 2024

• curprev 21:3121:31, 20 July 2024‎ 2603:8001:4542:28fb:69c1:e88e:3d77:f7c4 talk‎ 40,920 bytes −6‎ No edit summary undo

18 July 2024

• curprev 11:3011:30, 18 July 2024‎ 91.103.43.254 talk‎ 40,926 bytes +6‎ Change 'Dora' to 'Carol' for the third worker in the example (more common) undo

4 June 2024

• curprev 07:1907:19, 4 June 2024‎ David Eppstein talk contribs‎ 40,920 bytes −427‎ off-topic and badly-sourced WP:PEACOCK in lead undo

31 May 2024

• curprev 20:5020:50, 31 May 2024‎ Quantling talk contribs‎ 41,347 bytes −25‎ Acknowledge that the algorithm works even with initially negative costs undo

9 April 2024

• curprev 06:3306:33, 9 April 2024‎ WikiCleanerBot talk contribs‎ m 41,372 bytes 0‎ v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation) undo Tag: WPCleaner

31 March 2024

• curprev 16:3716:37, 31 March 2024‎ SKOgoras talk contribs‎ 41,372 bytes +939‎ →‎Matrix interpretation: Added sources and clarified undo

7 March 2024

• curprev 10:2010:20, 7 March 2024‎ 195.141.133.77 talk‎ 40,433 bytes +16‎ Made a statement more precise undo Tag: Visual edit
• curprev 09:4609:46, 7 March 2024‎ 195.141.133.77 talk‎ 40,417 bytes +6‎ Put an emphasis on tight in the definition of G_y. undo Tag: Visual edit

13 January 2024

• curprev 22:3622:36, 13 January 2024‎ Fredereit talk contribs‎ 40,411 bytes −1‎ Undid revision 1194722672 by 95.165.149.179 (talk). The new values for bob caused the "brute force" table below it to become incorrect and I do not see a reason for these changes, so reverting. undo Tag: Undo

10 January 2024

• curprev 11:5711:57, 10 January 2024‎ 95.165.149.179 talk‎ 40,412 bytes +1‎ →‎Example undo Tag: Reverted

21 December 2023

• curprev 18:2018:20, 21 December 2023‎ AnomieBOT talk contribs‎ m 40,411 bytes +19‎ Dating maintenance tags: {{Clarify}} undo
• curprev 16:1916:19, 21 December 2023‎ 109.147.202.77 talk‎ 40,392 bytes +36‎ →‎Step 4: not sure what prime means - one can prime a pump, or have prime numbers, but neither seem to apply. undo

24 November 2023

• curprev 00:1400:14, 24 November 2023‎ Pol098 talk contribs‎ 40,356 bytes 0‎ →‎top: move sentence about jacobi discovery undo

25 October 2023

• curprev 07:2807:28, 25 October 2023‎ 94.142.237.142 talk‎ 40,356 bytes −1‎ Fixed bug in "Connection to successive shortest paths" C++ example code, the same as in O(n^3) example fixed before. undo

24 October 2023

• curprev 08:0608:06, 24 October 2023‎ 94.142.237.142 talk‎ 40,357 bytes −1‎ Fixed bug in O(n^3) algorithm C++ example code. undo

5 September 2023

• curprev 08:5008:50, 5 September 2023‎ FrescoBot talk contribs‎ m 40,358 bytes −21‎ Bot: link syntax and minor changes undo

11 July 2023

• curprev 09:4909:49, 11 July 2023‎ 79.155.165.40 talk‎ 40,379 bytes +59‎ No edit summary undo

10 July 2023

• curprev 19:4219:42, 10 July 2023‎ 79.155.165.40 talk‎ 40,320 bytes +78‎ →‎External links: added a version of R.A. Pilgrim's implementation, as it is not available anymore. undo

15 June 2023

• curprev 19:2719:27, 15 June 2023‎ AtahkTahmeHare talk contribs‎ m 40,242 bytes −36‎ Removed unnecessary conditional "only following edges that are tight". undo Tag: Visual edit

13 June 2023

• curprev 16:3816:38, 13 June 2023‎ AltoStev talk contribs‎ 40,278 bytes 0‎ Replace <nowiki><math></nowiki> tags in section headers (see MOS:HEAD) undo Tag: Visual edit

8 June 2023

• curprev 16:4516:45, 8 June 2023‎ Neutronstar2 talk contribs‎ 40,278 bytes −1‎ No edit summary undo
• curprev 16:2016:20, 8 June 2023‎ AltoStev talk contribs‎ 40,279 bytes +1‎ Undid revision 1159155389 by AltoStev (talk) oh wait this is inconsistent undo Tags: Undo Mobile edit Mobile app edit Android app edit
• curprev 16:1816:18, 8 June 2023‎ AltoStev talk contribs‎ m 40,278 bytes −1‎ →‎top: rmv space btwn refs undo Tags: Reverted Mobile edit Mobile app edit Android app edit

22 May 2023

• curprev 10:1910:19, 22 May 2023‎ 2a01:e0a:306:c600:b402:991:de37:7675 talk‎ 40,279 bytes +13‎ →‎Adding the j-th job in O(jW) time: title in math tag undo
• curprev 10:1810:18, 22 May 2023‎ 2a01:e0a:306:c600:b402:991:de37:7675 talk‎ 40,266 bytes +14‎ →‎The algorithm in O(n^3) time: title in math tag undo

14 May 2023

• curprev 07:5707:57, 14 May 2023‎ AnomieBOT talk contribs‎ m 40,252 bytes +14‎ Dating maintenance tags: {{Confusing}} undo
• curprev 05:5705:57, 14 May 2023‎ B52481 talk contribs‎ 40,238 bytes +194‎ →‎Connection to successive shortest paths: - fix undefined behavior, add more about equivalence undo
• curprev 05:3305:33, 14 May 2023‎ B52481 talk contribs‎ 40,044 bytes 0‎ →‎The algorithm in O(n^3) time: - fix inaccuracy undo
• curprev 05:2305:23, 14 May 2023‎ B52481 talk contribs‎ 40,044 bytes +19‎ →‎Implementation in C++: - fix incorrect comment undo Tag: Visual edit: Switched
• curprev 04:5804:58, 14 May 2023‎ B52481 talk contribs‎ m 40,025 bytes +28‎ →‎Connection to successive shortest paths: - link to Johnson's algo page undo
• curprev 04:5704:57, 14 May 2023‎ B52481 talk contribs‎ 39,997 bytes +3,460‎ add connection to successive shortest paths undo
• curprev 03:1903:19, 14 May 2023‎ B52481 talk contribs‎ 36,537 bytes −63‎ remove "how" - O(n^3) algorithm is now described undo Tag: Visual edit: Switched
• curprev 03:0803:08, 14 May 2023‎ B52481 talk contribs‎ 36,600 bytes +264‎ add citation for code undo
• curprev 02:4302:43, 14 May 2023‎ B52481 talk contribs‎ 36,336 bytes +138‎ add more about the time complexity in →‎Adding the j-th job in O(jW) time undo
• curprev 02:4002:40, 14 May 2023‎ B52481 talk contribs‎ m 36,198 bytes +196‎ minor improvements to →‎Adding the j-th job in O(jW) time undo
• curprev 02:3402:34, 14 May 2023‎ B52481 talk contribs‎ m 36,002 bytes −44‎ remove math from headings undo
• curprev 02:3102:31, 14 May 2023‎ B52481 talk contribs‎ 36,046 bytes +7,192‎ add O(n^3) Hungarian algorithm + code undo Tag: Visual edit: Switched
• curprev 00:3100:31, 14 May 2023‎ B52481 talk contribs‎ 28,854 bytes +23‎ mark last step of matrix interpretation as unclear undo Tag: Visual edit: Switched

20 April 2023

• curprev 15:4615:46, 20 April 2023‎ Cadduk talk contribs‎ 28,831 bytes −180‎ Undid revision 1144784037 by Cmglee (talk) The procedure does not use the same naming conventions as the rest of the article. The presented algorithm seems to not work every time, or the description is at least not complete (what if no row or column has a single 0 ?), this is not the one detailed in the article. It is very confusing without a detailed explanation of the steps. undo Tag: Undo

16 March 2023

• curprev 03:1703:17, 16 March 2023‎ Cmglee talk contribs‎ 29,011 bytes +317‎ →‎Example: Add exhaustive proof undo

15 March 2023

• curprev 15:2415:24, 15 March 2023‎ Cmglee talk contribs‎ 28,694 bytes +28‎ →‎Example: Use less contrived values undo
• curprev 15:1115:11, 15 March 2023‎ Cmglee talk contribs‎ 28,666 bytes +52‎ →‎Example: Add {{diagonal split header}} undo
• curprev 15:1015:10, 15 March 2023‎ Cmglee talk contribs‎ 28,614 bytes +180‎ →‎top: Add worked example diagram undo Tag: Reverted

28 February 2023

• curprev 15:2415:24, 28 February 2023‎ 12.187.176.10 talk‎ 28,434 bytes +9‎ →‎Bipartite graph formulation undo
• curprev 15:2415:24, 28 February 2023‎ 12.187.176.10 talk‎ 28,425 bytes +10‎ →‎Bipartite graph formulation: , edited to make definition of E explicit undo

30 January 2023

• curprev 07:0707:07, 30 January 2023‎ OAbot talk contribs‎ m 28,415 bytes +16‎ Open access bot: doi added to citation with #oabot. undo

11 January 2023

• curprev 23:3623:36, 11 January 2023‎ AltoStev talk contribs‎ 28,399 bytes −38‎ Changing short description from "Combinatorial optimization algorithm that solves the assignment problem in polynomial time" to "Polynomial-time algorithm for the assignment problem" undo Tag: Shortdesc helper
• curprev 23:3523:35, 11 January 2023‎ AltoStev talk contribs‎ 28,437 bytes +827‎ →‎Matrix interpretation: Revise section. The logical structure is clearer but I use GOTO and (Else branch continued) in Step 4 so that could probably be simplified somehow. undo Tag: 2017 wikitext editor

8 January 2023

• curprev 22:1422:14, 8 January 2023‎ Joriki talk contribs‎ 27,610 bytes +40‎ →‎Matrix formulation: removed unnecessary double permutation (due to the cyclic invariance of the trace, the two permutations can be combined into one – only the workers or the jobs need to be permuted, not both) undo

31 December 2022

• curprev 19:0119:01, 31 December 2022‎ AltoStev talk contribs‎ 27,570 bytes −23‎ →‎Step 4: make clear that value is uncovered (based on https://medium.com/@riya.tendulkar/the-assignment-problem-using-hungarian-algorithm-4f105729af18) undo Tag: 2017 wikitext editor