Solve an assignment problem online

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.

Fill in the cost matrix (random cost matrix):

Size: 3x3 4x4 5x5 6x6 7x7 8x8 9x9 10x10

Don't show the steps of the Hungarian algorithm
Maximize the total cost

This is the original cost matrix:

52377911
28841997
37124263
51769610

Subtract row minima

We subtract the row minimum from each row:

4126680(-11)
965078(-19)
2503051(-12)
4166860(-10)

Subtract column minima

We subtract the column minimum from each column:

3226680
065078
1603051
3266860
(-9)

Cover all zeros with a minimum number of lines

There are 3 lines required to cover all zeros:

3226680
065078  x
1603051  x
3266860
x

Create additional zeros

The number of lines is smaller than 4. The smallest uncovered number is 26. We subtract this number from all uncovered elements and add it to all elements that are covered twice:

60420
0650104
1603077
640600

Cover all zeros with a minimum number of lines

There are 3 lines required to cover all zeros:

60420
0650104  x
1603077
640600
xx

Create additional zeros

The number of lines is smaller than 4. The smallest uncovered number is 6. We subtract this number from all uncovered elements and add it to all elements that are covered twice:

00360
0710110
1002477
040540

Cover all zeros with a minimum number of lines

There are 4 lines required to cover all zeros:

00360  x
0710110  x
1002477  x
040540  x

The optimal assignment

Because there are 4 lines required, the zeros cover an optimal assignment:

00360
0710110
1002477
040540

This corresponds to the following optimal assignment in the original cost matrix:

52377911
28841997
37124263
51769610

The optimal value equals 93.