Research Article

Degree-Constrained -Minimum Spanning Tree Problem

Table 2

Numerical results obtained with and for Euclidean graphs using and .

#Gaps
OptTimeLPTimeOptTimeLPTime % %

1Berlin5210274.46102.25253.210.34274.46600.94253.210.287.747.74
220926.77543991218.23801.280.20926.77591996300.65801.280.1913.5413.54
3301935.71424693336001666.190.201935.71529283236001666.190.1913.9213.92
4526081.63202461636005567.130.206081.63168860136005567.130.198.468.46
5gr962574.14488206360040.180.4174.14452709360040.180.3945.8145.81
650163.115132933600117.660.55162.804629023600117.660.4227.8627.73
775269.155935063600222.470.48269.236727753600222.470.4117.3417.37
896436.6511923673600384.510.80436.6911687843600384.510.7011.9411.95
9ch150501607.2424334236001258.470.951610.9315735336001258.470.9421.7021.88
10802657.2118647436002303.051.012694.8815476836002303.050.9013.3314.54
111003457.8619991436003058.710.973441.5912931836003058.710.9211.5411.13
121505914.1521578736005522.970.955923.7823488736005522.970.896.616.77

1Berlin5210279.2300.52261.790.30279.2300.53261.790.226.256.25
2201015.3922537.08862.040.251015.39873515.91862.040.2215.1015.10
3302065.12944612.211871.760.282065.125439.361871.760.279.369.36
4526968.7716998.246545.080.276968.7712447.446545.080.236.086.08
5gr962574.59380670360045.190.7774.59324849360045.192.3939.4239.42
650168.532704153600128.730.92174.251947523600128.738.4523.6226.12
775283.141548383600248.4413.60288.493104293600248.440.5812.2513.88
896474.951685393600452.149.66476.083975403600452.140.724.805.03
9ch150501753.839874236001356.911.041807.838631036001356.919.9122.6324.94
10802917.727382936002489.252.292881.726021036002489.2510.6414.6913.62
111003744.476671036003302.5415.884013.585451836003302.5414.0511.8017.72
121506411.736274336006158.671.156397.127057436006158.671.013.953.73