SINGH, ALOK; BAGHEL, ANURAG SINGH - In: Asia-Pacific Journal of Operational Research (APJOR) 25 (2008) 04, pp. 575-589
Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks a spanning tree of the graph with smallest weight among all spanning trees of the graph, which contains at least l leaves. In this paper we have proposed two new metaheuristic...