Assignment Problem Calculator

The Hungarian method is referred to as a combinatorial optimization technique that essentially solves the assignment problems in polynomial time.

Here are the steps involved in the Hungarian method.

• You need to subtract the smallest entry in each row from all the entries of its row.
• Now subtract the smallest in each column from all the entries of its column.
• You need to cover all zero entries by drawing a line through appropriate rows and columns.
•  Cover all zeroes with a minimum number of lines and create additional zeroes as well