Advances in Operations Research

Research Article

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Figure 9

LP solution of E C t with objective value 𝑓 l p = 3 / 2 + 𝜖 ( 𝑙 𝑎 = 𝜖 , 𝑙 𝑏 = 1 / 2 , 𝑙 𝑐 = 1 ) . The solution is not valid for E C t n , as the sum over the set of labels adjacent to nodes 𝑣 1 and 𝑣 2 are smaller than one.
143732.fig.009