Mostra el registre d'ítem simple
Heuristics for the MinLA problem: an empirical and theoretical analysis
dc.contributor.author | Díaz Cort, Josep |
dc.contributor.author | Petit Silvestre, Jordi |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.author | Spirakis, Paul George |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-22T09:39:45Z |
dc.date.available | 2016-11-22T09:39:45Z |
dc.date.issued | 1998-07 |
dc.identifier.citation | Diaz, J., Petit, J., Serna, M., Spirakis, P.G. "Heuristics for the MinLA problem: an empirical and theoretical analysis". 1998. |
dc.identifier.uri | http://hdl.handle.net/2117/96969 |
dc.description.abstract | This paper considers the development and the analysis of Local Search heuristics to approximate the Minimum Linear Arrangement problem. First of all, we present a new heuristic that we call SS+SA based on the combination of Spectral Sequencing and Simulated Annealing. This algorithm can be efficiently parallelized on distributed memory machines. |
dc.format.extent | 18 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Programació |
dc.subject.other | Local Search |
dc.subject.other | Heuristics |
dc.subject.other | Minimum linear arrangement |
dc.subject.other | SS+S |
dc.subject.other | Spectral sequencing |
dc.subject.other | Simulated annealing |
dc.title | Heuristics for the MinLA problem: an empirical and theoretical analysis |
dc.type | External research report |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.rights.access | Open Access |
local.identifier.drac | 515048 |
dc.description.version | Postprint (published version) |
local.citation.author | Diaz, J.; Petit, J.; Serna, M.; Spirakis, P.G. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [139]
-
Reports de recerca [1.107]