Assignment problem: Hungarian method 2
Assignment Problem: Hungarian method from Tobias Huber, Philipp Motsch & Marc 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.
Example:
There are 6 jobs for 6 candidates. The goal is to allocate the jobs to the candidates in a way where the costs are minimal.
This is the optimal solution. Taken together every candidate gets one job. The first candidate gets job 6, the second one gets job 3. candidate 3 gets job 2 ; the 4th candidate gets job 1. Job 5 belongs to candidate 5 and candidate 6 gets job 4.
References:
[1] Operations Research Skript TU Kaiserslautern, Prof. Dr. Oliver Wendt