Research Article
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques
Table 13
Overview of all test instances from SET-I, SET-II, and SET-III and corresponding best formulations.
| Set | | | | | Best formulation |
| Set-I | 100 | 0.2 | 50 | 1 | | | | | 100 | | , | | | | 125 | | | | | 0.5 | 50 | | , , | | | | 100 | | , | | | | 125 | | , | | | 0.8 | 50 | | , | | | | 100 | | , | | | | 125 | | , , | | 200 | 0.2 | 100 | | , | | | | 200 | | | | | | 250 | | , | | | 0.5 | 100 | | | | | | 200 | | | | | | 250 | | , | | | 0.8 | 100 | | | | | | 200 | | , | | | | 250 | | , |
| Set-II | 1000 | 4000 | 5 | | (several variants having same performance) | | | | 10 | | (several variants having same performance) | | | | 20 | | (several variants having same performance) |
| Set-III | 100 | 0.05 | | | Several methods having same performance | | | | | | | | | 0.2 | | | | | | | | | | | | 0.5 | | | | | | | | | | | | 0.05 | | 2 | (several variants having same performance) | | | | | | , | | | 0.2 | | | , | | | | | | | | | 0.5 | | | | | | | | | | | | 0.05 | | 5 | Several methods having | | | | | | | | | 0.2 | | | | | | | | | | | | 0.5 | | | , | | | | | | , |
| | | | 30 | 1 | (several variants having same performance) | | | | 50 | | | | | | 80 | | (best relaxation) | | | | 30 | | , | | | | 50 | | | | | | 80 | | (best relaxation) |
|
|