Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Combining spectral sequencing with simulated annealing for the MinLA problem: sequential and parallel heuristics

Autor
Petit, J.
Tipus d'activitat
Document cientificotècnic
Data
1997-11
Repositori
http://hdl.handle.net/2117/83805 Obrir en finestra nova
Resum
In this paper we present and analyze new sequential and parallel heuristics to approximate the Minimum Linear Arrangement problem (MinLA). The heuristics consist in obtaining a first global solution using Spectral Sequencing and improving it locally through Simulated Annealing. In order to accelerate the annealing process, we present a special neighborhood distribution that tends to favor moves with high probability to be accepted. We show how to make use of this neighborhood to par- allelize th...
Citació
Petit, J. "Combining spectral sequencing with simulated annealing for the MinLA problem: sequential and parallel heuristics". 1997.
Paraules clau
Heuristics, MinLa, Minimum linear arragement, Spectral sequencing
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius