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:

3233873175
445219738192
544160678779
789329228433
17127869944
40826839218

Subtract row minima

We subtract the row minimum from each row:

2728368120(-5)
25330546273(-19)
13019264638(-41)
5671706211(-22)
1167209338(-6)
34760778612(-6)

Subtract column minima

We subtract the column minimum from each column:

162836800
14330545073
2019263438
4571705011
067208138
23760777412
(-11)(-12)

Cover all zeros with a minimum number of lines

There are 5 lines required to cover all zeros:

162836800  x
14330545073
2019263438  x
4571705011  x
067208138  x
23760777412
x

Create additional zeros

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

1628156800
2210423861
2031263438
45711905011
068408138
1164065620

Cover all zeros with a minimum number of lines

There are 6 lines required to cover all zeros:

1628156800  x
2210423861  x
2031263438  x
45711905011  x
068408138  x
1164065620  x

The optimal assignment

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

1628156800
2210423861
2031263438
45711905011
068408138
1164065620

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

3233873175
445219738192
544160678779
789329228433
17127869944
40826839218

The optimal value equals 134.