Hungarian method
General · Mathematics
Study notes
Q: Solve assignment [[5,3],[4,6]] by Hungarian method. Row reduce: [[2,0],[0,2]] (subtract row mins 3, 4). Col reduce: [[2,0],[0,2]] (col mins 0, 0: same). Zeros: (1,2), (2,1). Min lines to cover: 2 = n: OPTIMAL! Assign: 1→2, 2→1: cost 3+4 = 7 ✓! (Hungarian: zeros reveal optimum!)