Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Table 14

Running times in seconds reported in [16], rounded to integers.

𝑙		5	10	20		5	10	20		5	10	20
𝑛		20				50				100
MLSTb		0	0	0		0	0	1		0	1	3
MLSTc		0	0	0		0	0	1		0	1	7
MLST-CL		0	0	0		0	0	0		0	0	1
𝑙		5	10	20		5	10	20		5	10	20
𝑛		200				500				1000
MLSTb		0	3	15		1	9	136		2	43	621
MLSTc		1	6	34		4	38	371		5	132	1994
MLST-CL		0	0	6		0	0	71		0	0	360
𝑙		5	10	20		5	10	20		5	10	20
𝑛		20				50				—	—	—
MLSTb		0	0	0		10	9	8		—	—	—
MLSTc		0	0	0		6	9	4		—	—	—
MLST-CL		0	0	0		45	0	0		—	—	—