Hungarian Method Solving Assignment Problem
For example: The Hungarian method, when applied to the above table, would give the minimum cost: this is , achieved by having Paul clean the bathroom, Dave sweep the floors, and Chris wash the windows.
There are two ways to formulate the problem: as a matrix or as a bipartite graph.
We consider an example where four jobs (J1, J2, J3, and J4) need to be executed by four workers (W1, W2, W3, and W4), one job per worker.
We maintain the invariant that all the edges of M are tight. In a general step, let increases (note that the number of tight edges does not necessarily increase).
The problem is to find the lowest-cost way to assign the jobs.
The problem can be represented in a matrix of the costs of the workers doing the jobs.
Fill in the cost matrix of an assignment problem and click on 'Solve'.
The optimal assignment will be determined and a step by step explanation of the hungarian algorithm will be given.