Row reduction prepares a cost matrix for the Hungarian algorithm: find the smallest entry in each row, then subtract it from every entry in that row. Each row’s minimum becomes zero, exposing possible low-cost assignments. section 3.1 section 3.4
Subtract each row’s minimum
In a worker-to-task cost matrix, Alice’s row minimum is 9, Bob’s is 9, and Carol’s is 8. Subtract each minimum from every entry in its row before proceeding to column reduction. section 3.1
Figure 3.2 The circled values in the cost matrix are the minimum values in respective rows. Row reduction is performed, and each value in the row is subtracted from the minimum value in that row.
The figure marks each row minimum and shows the matrix after subtracting those minima across the rows. section 3.1
