Degree-Constrained -Minimum Spanning Tree Problem

Table 8

Numerical results obtained with for large input graphs using .

#
			Opt		Time	LP	Time	%
Random graph instances
1	300	50	132.92	0	34.03	132.87	6.91	0.04
2		100	321.64	454	309.74	320.82	8.30	0.26
3		200	820.70	272	520.03	820.02	12.60	0.08
4		300	1623.85	1250	1301.40	1623.16	11.51	0.04
5	400	50	123.02	413	2003.07	120.05	19.05	2.42
6		100	265.68	30587	3073.49	262.44	19.19	1.22
7		200	598.20	2527	2448.10	595.08	34.01	0.52
8		400	1818.03	999	7200	1797.76	16.21	1.12
Euclidean graph instances
1	a280	50	534.97	13685	3600	384.00	5.48	28.22
2		100	1133.49	23212	3600	784.00	4.93	30.83
3		150	1417.20	11405	3600	1186.71	6.16	16.26
4		200	2991.96	11036	3600	2513.31	4.66	16.00