Exploració per tema "K-Cardinality tree Problem"
Ara es mostren els items 1-1 de 1
-
Metaheuristics for the edge-weighted K-cardinality tree problem
(2003-01)
Report de recerca
Accés obertMetaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the K-cardinality tree (KCT) problem in edge-weighted graphs. ...