3 votes

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

- rows or columns
- rows + columns
- rows + columns -1
- rows + columns +1