“…The experiments use some complete graph instances on 21, 41, 61, 81, 101, 121 and 161 nodes that have been used in previous papers for the HMSTP (see, for instance, [8]) and for other constrained spanning trees, namely the capacitated minimum spanning tree problem (see, for instance [36]). For each size, we have considered one random cost instance, denoted by TR, and two Euclidean cost instances.…”