Heuristics for the MinLA problem: an empirical and theoretical analysis

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/96969

Title:	Heuristics for the MinLA problem: an empirical and theoretical analysis
Author:	Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José; Spirakis, Paul George
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
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.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Programació -Local Search -Heuristics -Minimum linear arrangement -SS+S -Spectral sequencing -Simulated annealing
Rights:
Document type:	Article - Published version Report
Share: