Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Metaheuristics for the edge-weighted K-cardinality tree problem

Autor
Blum, C.; Blesa, M.
Tipus d'activitat
Document cientificotècnic
Data
2003-01
Codi
LSI-03-1-R
Repositori
http://hdl.handle.net/2117/97393 Obrir en finestra nova
Resum
Metaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the $-cardinality tree (KCT) problem in edge-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. There are already metaheuristic approaches to tackle the KCT problem to be found in the literature. However, there is a lack of benchmark problem instances and therefor...
Citació
Blum, C., Blesa, M. "Metaheuristics for the edge-weighted K-cardinality tree problem". 2003.
Paraules clau
Metaheuristics, Combinatorial Optimization, Kct, K-cardinality Tree Problem, Ant Colony Optimization, Evolutionary Computation, Tabu Search, Spanning Trees
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius