Degree-Constrained -Minimum Spanning Tree Problem

Table 1

Numerical results obtained with and for random graphs using and .

#													Gaps
			Opt		Time	LP	Time	Opt		Time	LP	Time	%	%
1	50	10	46.86	75	0.80	43.38	0.17	46.86	109	1.06	43.38	0.19	7.43	7.43
2		20	113.97	498	0.75	109.46	0.20	113.97	362	0.73	109.46	0.19	3.96	3.96
3		30	204.35	1470	2.79	199.05	0.19	204.35	1911	3.48	199.05	0.17	2.59	2.59
4		50	459.09	1005	1.76	453.49	0.19	459.09	2901	5.74	453.49	0.17	1.22	1.22
5	100	25	115.44	23	1.95	114.63	0.48	115.44	25	1.79	114.63	0.42	0.69	0.69
6		50	263.95	2501	8.30	262.04	0.47	263.95	1872	6.43	262.04	0.42	0.73	0.73
7		75	454.44	3186	5.04	451.58	0.42	454.44	1715	24.23	451.58	0.42	0.63	0.63
8		100	749.75	36160	202.21	745.09	0.45	749.75	65193	338.15	745.09	0.44	0.62	0.62
9	200	50	162.55	1035	10.39	160.88	1.73	162.55	1462	10.86	160.88	1.64	1.03	1.03
10		100	378.43	80814	506.06	374.87	1.67	378.43	94564	518.29	374.87	1.65	0.94	0.94
11		150	652.86	2944093	6417.84	648.89	1.73	652.86	2635764	7200	648.89	1.95	0.61	0.61
12		200	1049.25	403853	7200	1044.74	2.26	1049.25	215415	7200	1044.74	1.78	0.43	0.43
1	50	10	52.22	49	1.58	46.30	0.17	52.22	129	0.61	46.30	0.17	11.34	11.34
2		20	134.08	237	2.06	129.71	0.22	134.08	904	2.57	129.71	0.22	3.26	3.26
3		30	240.30	45	1.26	239.32	0.20	240.30	9	1.26	239.32	0.20	0.41	0.41
4		50	564.37	2948	7.38	557.08	0.19	564.37	1953	7.47	557.08	0.17	1.29	1.29
5	100	25	123.71	404	4.63	121.54	0.48	123.71	148	3.99	121.54	0.45	1.75	1.75
6		50	287.78	1093	37.88	285.31	0.61	287.78	1875	7.75	285.31	0.50	0.86	0.86
7		75	529.56	0	1.92	529.31	0.50	529.56	1	3.99	529.31	0.48	0.05	0.05
8		100	915.29	683	9.75	914.63	0.48	915.29	77	8.14	914.63	0.45	0.07	0.07
9	200	50	184.29	0	12.28	184.29	2.11	184.29	0	7.02	184.29	2.03	0	0
10		100	437.08	6424	99.08	435.45	2.50	437.08	2568	93.76	435.45	2.28	0.37	0.37
11		150	775.89	275	94.08	774.76	2.40	775.89	90	42.20	774.76	2.20	0.15	0.15
12		200	1285.32	190	67.75	1284.58	2.23	1285.32	459	98.28	1284.58	1.89	0.06	0.06