Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Table 1

MLST formulations resulting from combining the equations and inequalities from Section 3. Further variants are given by the use of the components listed in the second part of the table, to be used as index for the formulation to be used with.

Abbrevation	Involved equations and inequalities
SCF	(3.1), (3.2), (3.6)–(3.8)
MCF	(3.1), (3.2), (3.5), (3.9), (3.8)
DCut	(3.1), (3.2), (3.5), (3.11), (3.12), (3.13), (3.14)
EC	(3.1), (3.2), (3.5), (3.20), (3.18)
MTZ	(3.1), (3.2), (3.16)
CEF	(3.1), (3.2), (3.15)
𝑛	Node-label-constraints (3.22)
𝑛̃	Extended node-label-constraints (3.23)
𝑡	Tree search, that is, fixed number of edges (3.5)
𝑠	Strong linkage (3.21)
𝑐	Cycle elimination inequalities (3.15)
𝑜	Odd hole inequalities
𝑝	Variable pricing