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

Solution

This is the cost matrix.

66	32	55	15
53	99	66	31
12	16	17	59
83	69	26	16

Subtract row minima

For each row, the minimum element is subtracted from all elements in that row.

51	17	40	0	(-15)
22	68	35	0	(-31)
0	4	5	47	(-12)
67	53	10	0	(-16)

Subtract column minima

For each column, the minimum element is subtracted from all elements in that column.

51	13	35	0
22	64	30	0
0	0	0	47
67	49	5	0
	(-4)	(-5)

Cover all zeros with a minimum number of lines

A total of 2 lines are required to cover all zeros.

51	13	35	0
22	64	30	0
0	0	0	47	x
67	49	5	0
			x

Create additional zeros

The number of lines is smaller than 4. The smallest uncovered element is 5. We subtract this value from all uncovered elements and add it to all elements covered twice.

46	8	30	0
17	59	25	0
0	0	0	52
62	44	0	0

Cover all zeros with a minimum number of lines

A total of 3 lines are required to cover all zeros.

46	8	30	0
17	59	25	0
0	0	0	52	x
62	44	0	0	x
			x

Create additional zeros

The number of lines is smaller than 4. The smallest uncovered element is 8. We subtract this value from all uncovered elements and add it to all elements covered twice.

38	0	22	0
9	51	17	0
0	0	0	60
62	44	0	8

Cover all zeros with a minimum number of lines

A total of 4 lines are required to cover all zeros.

38	0	22	0	x
9	51	17	0	x
0	0	0	60	x
62	44	0	8	x

The optimal assignment

Because there are 4 lines required, an optimal assignment exists among the zeros.

38	0	22	0
9	51	17	0
0	0	0	60
62	44	0	8

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

66	32	55	15
53	99	66	31
12	16	17	59
83	69	26	16

The total minimum cost is 101.