Advances in Operations Research

Research Article

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Table 15

Running times for instances that have been created according to specification from [16]. The first column lists the method for the corresponding row. In parenthesis the corresponding method from [16] is reported.
𝑙 5 10 20 5 10 20 5 10 20
𝑛 2050100
avg ( | 𝐿 𝑇 | ) 2.0 2.5 3.8 2.4 3.3 5.0 3.0 4.1 6.6
SCF (MLSTb) 0 0 0 0 0 0 0 0 19
S C F t n 0 0 0 0 0 0 0 0 1
D C u t t n 0 0 0 0 0 0 0 0 1
E C t n 0 0 0 0 0 0 0 0 0
E C s n 0 0 0 0 0 0 0 0 0
𝐴 ∗ (MLST-CL) 0 0 0 0 0 0 0 0 1
𝑙 5 10 20 5 10 20 5 10 20
𝑛 2005001000
avg ( | 𝐿 𝑇 | ) 3.0 5.0 7.9 3.5 5.9 9.9 4.1 6.6 11.3
SCF (MLSTb) 3 3 9 71 29 384 31 96 1303
S C F t n 0 1 6 0 4 19 1 13 51
D C u t t n 0 0 4 1 3 21 12 13 67
E C t n 0 0 0 0 0 0 0 0 0
E C s n 0 0 0 0 0 0 0 0 0
𝐴 ∗ (MLST-CL) 0 0 13 0 0 159 0 0 609
𝑑 0.2 0.5 0.8 0.2 0.5 0.8———
𝑛 2050———
avg ( | 𝐿 𝑇 | ) 7.1 3.5 2.2 3.0 3.9 7.6———
SCF (MLSTb) 0 0 0 23 40 25———
S C F t n 0 0 0 3 0 1———
D C u t t n 0 0 0 5 2 2———
E C n 0 0 0 0 0 0———
E C s n 0 0 0 0 0 0———
𝐴 ∗ (MLST-CL) 0 0 0 67 0 0———