Mostra el registre d'ítem simple

dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-05-24T09:08:56Z
dc.date.available2016-05-24T09:08:56Z
dc.date.issued2003-11
dc.identifier.citationXhafa, F. "An implementation of a generic memetic algorithm for the edge biconnectivity augmentation problem". 2003.
dc.identifier.urihttp://hdl.handle.net/2117/87262
dc.description.abstractIn this paper we present an implementation of a generic memetic algorithm for the edge bi-connectivity augmentation problem --the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge bi-connected. This problem is known for its applications to communication network design --the extension of an existing communication network to become robust against single link failures-- as well as in VLSI floor planning. We provide a C++ implementation of a generic memetic algorithm for the problem, as a good alternative for approximately solving it. We use known benchmarks in the literature for the problem as to experimentally evaluate how good the generic memetic algorithm works for the problem.
dc.format.extent10 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-03-47-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherMemetic algorithm
dc.subject.otherBi-connectivity augmentation problem
dc.titleAn implementation of a generic memetic algorithm for the edge biconnectivity augmentation problem
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac18533824
dc.description.versionPostprint (published version)
local.citation.authorXhafa, F.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple