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:

76	9	57	90	75	31	80	38	5
63	9	69	75	6	86	14	10	84
29	99	86	65	48	61	86	26	91
43	90	53	28	50	72	50	51	87
26	24	33	98	89	10	8	81	2
69	95	14	11	7	29	66	95	27
82	39	64	7	3	15	78	21	31
61	12	63	2	54	59	24	42	6
58	82	2	90	35	73	75	23	8

Subtract row minima

We subtract the row minimum from each row:

71	4	52	85	70	26	75	33	0	(-5)
57	3	63	69	0	80	8	4	78	(-6)
3	73	60	39	22	35	60	0	65	(-26)
15	62	25	0	22	44	22	23	59	(-28)
24	22	31	96	87	8	6	79	0	(-2)
62	88	7	4	0	22	59	88	20	(-7)
79	36	61	4	0	12	75	18	28	(-3)
59	10	61	0	52	57	22	40	4	(-2)
56	80	0	88	33	71	73	21	6	(-2)

Subtract column minima

We subtract the column minimum from each column:

68	1	52	85	70	18	69	33	0
54	0	63	69	0	72	2	4	78
0	70	60	39	22	27	54	0	65
12	59	25	0	22	36	16	23	59
21	19	31	96	87	0	0	79	0
59	85	7	4	0	14	53	88	20
76	33	61	4	0	4	69	18	28
56	7	61	0	52	49	16	40	4
53	77	0	88	33	63	67	21	6
(-3)	(-3)				(-8)	(-6)

Cover all zeros with a minimum number of lines

There are 7 lines required to cover all zeros:

68	1	52	85	70	18	69	33	0	x
54	0	63	69	0	72	2	4	78	x
0	70	60	39	22	27	54	0	65	x
12	59	25	0	22	36	16	23	59
21	19	31	96	87	0	0	79	0	x
59	85	7	4	0	14	53	88	20
76	33	61	4	0	4	69	18	28
56	7	61	0	52	49	16	40	4
53	77	0	88	33	63	67	21	6	x
			x	x

Create additional zeros

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

68	1	52	89	74	18	69	33	0
54	0	63	73	4	72	2	4	78
0	70	60	43	26	27	54	0	65
8	55	21	0	22	32	12	19	55
21	19	31	100	91	0	0	79	0
55	81	3	4	0	10	49	84	16
72	29	57	4	0	0	65	14	24
52	3	57	0	52	45	12	36	0
53	77	0	92	37	63	67	21	6

Cover all zeros with a minimum number of lines

There are 8 lines required to cover all zeros:

68	1	52	89	74	18	69	33	0
54	0	63	73	4	72	2	4	78	x
0	70	60	43	26	27	54	0	65	x
8	55	21	0	22	32	12	19	55
21	19	31	100	91	0	0	79	0	x
55	81	3	4	0	10	49	84	16	x
72	29	57	4	0	0	65	14	24	x
52	3	57	0	52	45	12	36	0
53	77	0	92	37	63	67	21	6	x
			x					x

Create additional zeros

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

67	0	51	89	73	17	68	32	0
54	0	63	74	4	72	2	4	79
0	70	60	44	26	27	54	0	66
7	54	20	0	21	31	11	18	55
21	19	31	101	91	0	0	79	1
55	81	3	5	0	10	49	84	17
72	29	57	5	0	0	65	14	25
51	2	56	0	51	44	11	35	0
53	77	0	93	37	63	67	21	7

Cover all zeros with a minimum number of lines

There are 8 lines required to cover all zeros:

67	0	51	89	73	17	68	32	0
54	0	63	74	4	72	2	4	79
0	70	60	44	26	27	54	0	66	x
7	54	20	0	21	31	11	18	55
21	19	31	101	91	0	0	79	1	x
55	81	3	5	0	10	49	84	17	x
72	29	57	5	0	0	65	14	25	x
51	2	56	0	51	44	11	35	0
53	77	0	93	37	63	67	21	7	x
	x		x					x

Create additional zeros

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

65	0	49	89	71	15	66	30	0
52	0	61	74	2	70	0	2	79
0	72	60	46	26	27	54	0	68
5	54	18	0	19	29	9	16	55
21	21	31	103	91	0	0	79	3
55	83	3	7	0	10	49	84	19
72	31	57	7	0	0	65	14	27
49	2	54	0	49	42	9	33	0
53	79	0	95	37	63	67	21	9

Cover all zeros with a minimum number of lines

There are 8 lines required to cover all zeros:

65	0	49	89	71	15	66	30	0
52	0	61	74	2	70	0	2	79
0	72	60	46	26	27	54	0	68	x
5	54	18	0	19	29	9	16	55
21	21	31	103	91	0	0	79	3
55	83	3	7	0	10	49	84	19
72	31	57	7	0	0	65	14	27
49	2	54	0	49	42	9	33	0
53	79	0	95	37	63	67	21	9	x
	x		x	x	x	x		x

Create additional zeros

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

63	0	47	89	71	15	66	28	0
50	0	59	74	2	70	0	0	79
0	74	60	48	28	29	56	0	70
3	54	16	0	19	29	9	14	55
19	21	29	103	91	0	0	77	3
53	83	1	7	0	10	49	82	19
70	31	55	7	0	0	65	12	27
47	2	52	0	49	42	9	31	0
53	81	0	97	39	65	69	21	11

Cover all zeros with a minimum number of lines

There are 9 lines required to cover all zeros:

63	0	47	89	71	15	66	28	0	x
50	0	59	74	2	70	0	0	79	x
0	74	60	48	28	29	56	0	70	x
3	54	16	0	19	29	9	14	55	x
19	21	29	103	91	0	0	77	3	x
53	83	1	7	0	10	49	82	19	x
70	31	55	7	0	0	65	12	27	x
47	2	52	0	49	42	9	31	0	x
53	81	0	97	39	65	69	21	11	x

The optimal assignment

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

63	0	47	89	71	15	66	28	0
50	0	59	74	2	70	0	0	79
0	74	60	48	28	29	56	0	70
3	54	16	0	19	29	9	14	55
19	21	29	103	91	0	0	77	3
53	83	1	7	0	10	49	82	19
70	31	55	7	0	0	65	12	27
47	2	52	0	49	42	9	31	0
53	81	0	97	39	65	69	21	11

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

76	9	57	90	75	31	80	38	5
63	9	69	75	6	86	14	10	84
29	99	86	65	48	61	86	26	91
43	90	53	28	50	72	50	51	87
26	24	33	98	89	10	8	81	2
69	95	14	11	7	29	66	95	27
82	39	64	7	3	15	78	21	31
61	12	63	2	54	59	24	42	6
58	82	2	90	35	73	75	23	8

The optimal value equals 114.

HungarianAlgorithm.com © 2013-2025