Öncan, Temel; Cordeau, Jean-François; Laporte, Gilbert - In: European Journal of Operational Research 191 (2008) 2, pp. 306-319
This paper describes an attribute based tabu search heuristic for the generalized minimum spanning tree problem (GMSTP) known to be NP-hard. Given a graph whose vertex set is partitioned into clusters, the GMSTP consists of designing a minimum cost tree spanning all clusters. An attribute based...