Degree-Constrained -Minimum Spanning Tree Problem

Table 7

Numerical results obtained with for large input graphs using .

#
			Opt		Time	LP	Time	%
Random graph instances
1	300	50	118.82	120	40.30	117.39	4.40	1.20
2		100	283.63	3719	64.73	281.70	4.20	0.68
3		200	703.42	994913	2022.93	701.15	4.21	0.32
4		300	1334.61	177538	7200	1332.44	5.01	0.16
5	400	50	110.20	1651	193.66	108.48	8.47	1.56
6		100	236.59	10088	2316.85	234.51	9.48	0.88
7		200	522.61	13577	259.07	520.66	8.24	0.37
8		400	1459.53	31763	7200	1456.34	10.84	0.22
Euclidean graph instances
1	a280	50	480.35	23222	3600	384.00	4.21	20.06
2		100	1011.07	42957	3600	784.00	4.52	22.46
3		150	1316.17	28761	3600	1184.16	4.57	10.03
4		280	2493.68	46232	3600	2385.76	3.85	4.33