Advantages and Disadvantages of the Hungarian Algorithm

The Hungarian algorithm is a combinatorial optimization algorithm that solves the task assignment problem in polynomial time.

The Hungarian algorithm is a combinatorial optimization algorithm that is a faster way to solve polynomial time complexity problems.

1. find the smallest element from each row and subtract that value from all the elements in that row;

2. find the smallest element from each column and subtract that value from all the elements in that column;

3. such that m = the smallest number of rows needed to cover all the zeros in the table;

4. while (m! = the smallest number of number of columns)

find the smallest element from those found

subtract this element from all other elements not found

add this element to the elements where the lines intersect

find the new

5. use zeros to assign possible combinations, i.e., assign tasks whenever zeros exist;

6. find the the lowest cost;

7. end.