Show simple item record

dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-11-10T09:00:52Z
dc.date.available2016-11-10T09:00:52Z
dc.date.issued2000-09
dc.identifier.citationBlesa, M., Xhafa, F. "A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse". 2000.
dc.identifier.urihttp://hdl.handle.net/2117/96454
dc.description.abstractWe present a C++ implementation of Tabu Search method for the Minimum k-Cardinality Tree problem. Tabu Search is a well known heuristic for sub-optimally solving optimization problems. This method applies also to Minimum k-Cardinality Tree --an important problem to both theory and industrial applications. Our implementation is based on generic programming and re-usability of several components for Tabu Search method. We have compared our program with other ad hoc implementations for the problem and have observed a good performance of our implementation. Moreover, our implementation represents time savings, flexibility and robustness mainly due to the component reuse.
dc.format.extent13 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-00-49-R
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherK-cardinality tree problem
dc.subject.otherC++
dc.subject.otherTabu Search
dc.subject.otherGeneric programming
dc.subject.otherOptimization
dc.subject.otherReusing components
dc.titleA C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac647473
dc.description.versionPostprint (published version)
local.citation.authorBlesa, M.; Xhafa, F.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder