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:

9322366835990
804635496375
73574664811260
99947793142046
9877282888210
8335163693340
69833170251686

Subtract row minima

We subtract the row minimum from each row:

9102164815788(-2)
764231092331(-4)
6145345269048(-12)
858063790632(-14)
967526086808(-2)
8032130663037(-3)
536715549070(-16)

Subtract column minima

We subtract the column minimum from each column:

380864815787
234218092330
845215269047
328050790631
437513086807
273200663036
0672549069
(-53)(-13)(-1)

Cover all zeros with a minimum number of lines

There are 7 lines required to cover all zeros:

380864815787  x
234218092330  x
845215269047  x
328050790631  x
437513086807  x
273200663036  x
0672549069  x

The optimal assignment

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

380864815787
234218092330
845215269047
328050790631
437513086807
273200663036
0672549069

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

9322366835990
804635496375
73574664811260
99947793142046
9877282888210
8335163693340
69833170251686

The optimal value equals 120.