• Metaheuristics for the edge-weighted K-cardinality tree problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
    Report de recerca
    Accés obert
    Metaheuristics 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. ...