Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorPetit Silvestre, Jordi
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorSpirakis, Paul George
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationDiaz, J., Petit, J., Serna, M., Spirakis, P.G. "Heuristics for the MinLA problem: an empirical and theoretical analysis". 1998.
dc.description.abstractThis 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.extent18 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.otherLocal Search
dc.subject.otherMinimum linear arrangement
dc.subject.otherSpectral sequencing
dc.subject.otherSimulated annealing
dc.titleHeuristics for the MinLA problem: an empirical and theoretical analysis
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorDiaz, J.; Petit, J.; Serna, M.; Spirakis, P.G.

Files in this item


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