Assignment problem: Hungarian method 2

Assignment Problem: Hungarian method from Tobias Huber, Philipp Motsch, Kool Sarvas

Theory:

---

The hungarian method is a special form of the linear optimazation. We assume that the initial matrix is a n x n matrix. The main goal is to reduce the matrix column by column and line by line until you get a unique allocation.

The hungarian method can be displayed in the following steps:

1. Determine the column minima and write every minima of the columns into the row vj
2. Subtract the column minima from the elements of the corresponding columns
3. Determine the row minima and write every minima of the rows into the column ui
4. Subtract the row minima from the elements of the corresponding rows. We obtain a matrix with at least one "0" in each row and column.
5. Determine the maximal number of indepentent "0" in the matrix. First, find a row or a column which has a minimal number of "0". Mark a "0" and wipe all of the remaining "0"`s 
   of the same row and column
6. If the maxinmal number of independent "0" does not equal the number of row or column, determine the minimal number of lines which cover all the "0"`s
    -->This number is equal to the maximal number of independent "0"`s
7.