...

------------------------------------------
BipartiteMatchingsHungarianMethod: Matrix

...

Take 3 lines to cover rows with {1, 0, 0, 0} and columns with {1, 1, 0, 0}

Smallest uncovered value 1.

Zero elements of reduced cost matrix: {{1, 3}, {1, 4}, {2, 2}, {2, 3}, {3, 1}, {3, 2}, {4, 1}}

Remaining zero elements of reduced cost matrix: {{2, 2}, {2, 3}, {3, 1}, {3, 2}, {4, 1}}

Remaining zero elements of reduced cost matrix: {{3, 1}, {3, 2}, {4, 1}}

Remaining zero elements of reduced cost matrix: {{4, 1}}

Remaining zero elements of reduced cost matrix: {{0, 0}}

...

Unique total cost of 20. by assignments: {{1, 4}, {2, 3}, {3, 2}, {4, 1}}

BipartiteMatchingsHungarianMethod: Matrix

------------------------------------------

...