In this paper we present a memetic algorithm for the minimum weighted k-cardinality tree subgraph problem. This problem consists in finding, in a given undirected weighted graph G=(V,E,W), a tree T of k edges having minimal ...