Allocation problems - The Hungarian Algorithm The Hungarian algorithm Step 1Reduce the array by both row and column subtractions Step 2Cover the zero elements.
The Hungarian Algorithm – Non-square arrays The Hungarian algorithm for non-square arrays If an array is not square, start by adding a dummy row or column.
