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:

37460
35564
85961

Subtract row minima

We subtract the row minimum from each row:

07157(-3)
05261(-3)
84950(-1)

Subtract column minima

We subtract the column minimum from each column:

01957
0061
84430
(-52)

Cover all zeros with a minimum number of lines

There are 3 lines required to cover all zeros:

01957  x
0061  x
84430  x

The optimal assignment

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

01957
0061
84430

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

37460
35564
85961

The optimal value equals 59.