Consoli, S.; Darby-Dowman, K.; Mladenovic, N.; Moreno … - In: European Journal of Operational Research 196 (2009) 2, pp. 440-449
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible. Given an undirected labelled connected graph, the minimum labelling spanning tree problem seeks a spanning tree whose edges...