A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse

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 applica...

Descripción completa

Detalles Bibliográficos
Autores: Blesa Aguilera, Maria Josep|||0000-0001-8246-9926, Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Tipo de recurso: informe técnico
Fecha de publicación:2000
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/96454
Acceso en línea:https://hdl.handle.net/2117/96454
Access Level:acceso abierto
Palabra clave:K-cardinality tree problem
C++
Tabu Search
Generic programming
Optimization
Reusing components
Àrees temàtiques de la UPC::Informàtica
id ES_98128bb527a5b198ca9fdb2e5cbccf8f
oai_identifier_str oai:upcommons.upc.edu:2117/96454
network_acronym_str ES
network_name_str España
repository_id_str
spelling A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuseBlesa Aguilera, Maria Josep|||0000-0001-8246-9926Xhafa Xhafa, Fatos|||0000-0001-6569-5497K-cardinality tree problemC++Tabu SearchGeneric programmingOptimizationReusing componentsÀrees temàtiques de la UPC::InformàticaWe 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.20002000-09-0120162016-11-10reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/96454reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/964542026-05-27T15:37:01Z
dc.title.none.fl_str_mv A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
title A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
spellingShingle A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
K-cardinality tree problem
C++
Tabu Search
Generic programming
Optimization
Reusing components
Àrees temàtiques de la UPC::Informàtica
title_short A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
title_full A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
title_fullStr A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
title_full_unstemmed A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
title_sort A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
dc.creator.none.fl_str_mv Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author_facet Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_role author
author2 Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author2_role author
dc.subject.none.fl_str_mv K-cardinality tree problem
C++
Tabu Search
Generic programming
Optimization
Reusing components
Àrees temàtiques de la UPC::Informàtica
topic K-cardinality tree problem
C++
Tabu Search
Generic programming
Optimization
Reusing components
Àrees temàtiques de la UPC::Informàtica
description 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.
publishDate 2000
dc.date.none.fl_str_mv 2000
2000-09-01
2016
2016-11-10
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/96454
url https://hdl.handle.net/2117/96454
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869414163703398400
score 15,300724

Similares en LA Referencia