Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem


In this paper we deal with an NP -hard combinatorial optimization problem, the kcardinality tree problem in edge-weighted graphs. This problem has several applications in practice, which justify the need for eÆcient methods to obtain good solutions. Metaheuristic applications have already been shown to be successful in tackling the kcardinality tree problem… (More)


5 Figures and Tables