Setting
We are given a nonnegative n×n matrix, where the element in the i-th row and j-th column represents the cost of assigning the j-th job to the i-th worker. We have to find an assignment of the jobs to the workers that has minimum cost. If the goal is to find the assignment that yields the maximum cost, the problem can be altered to fit the setting by replacing each cost with the maximum cost subtracted by the cost.
The algorithm is easier to describe if we formulate the problem using a bipartite graph. We have a complete bipartite graph G=(S, T; E) with n worker vertices (S) and n job vertices (T), and each edge has a nonnegative cost c(i,j). We want to find a perfect matching with minimum cost.
Let us call a function a potential if for each . The value of potential y is . It can be seen that the cost of each perfect matching is at least the value of each potential. The Hungarian method finds a perfect matching and a potential with equal cost/value which proves the optimality of both. In fact it finds a perfect matching of tight edges: an edge ij is called tight for a potential y if . Let us denote the subgraph of tight edges by . The cost of a perfect matching in (if there is one) equals the value of y.
Read more about this topic: Hungarian Algorithm
Famous quotes containing the word setting:
“The trees stand in the setting sun,
I in their freckled shade
Regard the cavalcade of sin,
Remorse for foolish action done,
That pass like ghosts regardless, in
A human image made....”
—Philip Larkin (1922–1986)
“High from the summit of a craggy cliff,
Hung o’er the deep, such as amazing frowns
On utmost Kilda’s shore, whose lonely race
Resign the setting sun to Indian worlds,
The royal eagle draws his vigorous young”
—James Thomson (1700–1748)
““Oh, let’s go up the hill and scare ourselves,
As reckless as the best of them tonight,
By setting fire to all the brush we piled
With pitchy hands to wait for rain or snow....””
—Robert Frost (1874–1963)