Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem

Autor
Blesa, M.; Moscato, P.; Xhafa, F.
Tipus d'activitat
Document cientificotècnic
Data
2001-03
Codi
R01-12
Repositori
http://hdl.handle.net/2117/97659 Obrir en finestra nova
Resum
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 total weight among all of k-trees that are subgraphs of G. This problem was first described by Hamacher, Jornsten, and Maffioli (1991) who also proved to be strongly NP-hard. Given this observation, researchers have focused on heuristic and metaheuristic algorithms to fi...
Citació
Blesa, M., Moscato, P., Xhafa, F. "A Memetic algorithm for the minimum weighted k-cardinality tree subgraph problem". 2001.
Paraules clau
Memetic Algorithm, Minimum Weighted K-cardinality Tree Subgraph Problem
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius