Mostra el registre d'ítem simple
A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
dc.contributor.author | Blesa Aguilera, Maria Josep |
dc.contributor.author | Xhafa Xhafa, Fatos |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-10T09:00:52Z |
dc.date.available | 2016-11-10T09:00:52Z |
dc.date.issued | 2000-09 |
dc.identifier.citation | Blesa, 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.uri | http://hdl.handle.net/2117/96454 |
dc.description.abstract | We 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.extent | 13 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-00-49-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | K-cardinality tree problem |
dc.subject.other | C++ |
dc.subject.other | Tabu Search |
dc.subject.other | Generic programming |
dc.subject.other | Optimization |
dc.subject.other | Reusing components |
dc.title | A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 647473 |
dc.description.version | Postprint (published version) |
local.citation.author | Blesa, M.; Xhafa, F. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]