Loading...
Loading...

Go to the content (press return)

Heuristics for the MinLA problem: an empirical and theoretical analysis

Author
Diaz, J.; Petit, J.; Serna, M.; Spirakis, P.G.
Type of activity
Report
Date
1998-07
Repository
http://hdl.handle.net/2117/96969 Open in new window
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.
Citation
Diaz, J., Petit, J., Serna, M., Spirakis, P.G. "Heuristics for the MinLA problem: an empirical and theoretical analysis". 1998.
Keywords
Heuristics, Local Search, Minimum linear arrangement, SS+S, Simulated annealing, Spectral sequencing
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments