• Citer

New metaheuristic approaches for the edge-weighted k-cardinality tree problem

par Blum, Christian ;Blesa, Maria
Référence Computers & operations research, 32, 6, page (1355-1377)
Publication Publié, 2005-06

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

In this paper we propose three metaheuristic approaches, namely a Tabu Search, an Evolutionary Computation and an Ant Colony Optimization approach, for the edge-weighted k-cardinality tree (KCT) problem. This problem is an NP-hard combinatorial optimization problem that generalizes the well-known minimum weight spanning tree problem. Given an edge-weighted graph G = (V, E), it consists of finding a tree in G with exactly k ≤