Breaking ties in the "Hungarian Method" of solving the standard Assignment Problem.

What is it about?

Using the "Hungarian Method" of solving the standard Assignment Problem, there can be a glitch in program codes when there are more than one remaining zero to be chosen. The article explains how to make that choice to ensure the algorithm works properly.

Featured Image

Why is it important?

Many programs have hidden the coding of the algorithm's procedure, and there are data cases when the algorithm should work but will not if the code does not check properly for ties to choose from several zeros in the routine if the code is for the Hungarian algorithm (Maximal cover using lines).

Perspectives