Dionisio Pérez-Brito

Dionisio Pérez-Brito

Auto-generated profile, based on publicly available information

Dionisio Pérez-Brito

Universidad de La Laguna

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
JPJusto Puerto
Justo Puerto
DPDionisio Pérez-Brito
Dionisio Pérez-Brito
CGCarlos Gustavo García-González
Carlos Gustavo García-González

1 January 2016 in Yugoslav Journal of Operations Research
Verified
Journal Article
Open access
PDF file
NMNenad Mladenovic
Nenad Mladenovic
DUDragan Urosevic
Dragan Urosevic
DPDionisio Pérez-Brito
Dionisio Pérez-Brito
The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. It consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. This problem is one among the classical NP-hard optimization problems and therefore there has been extensive research on exact and approximative algorithms. In this paper we present an implementation of a variable neighborhood search (VNS) for solving minimum linear arrangement problem. We use Skewed general VNS scheme that appeared to be successful in solving some recent optimization problems on graphs. Based on computational experiments, we argue that our approach is comparable with the state-of-the-art heuristic.

1 June 2005 in TOP
Verified
Journal Article
Closed access
PDF file
ARA. M. Rodríguez-Chía
A. M. Rodríguez-Chía
JPJusto Puerto
Justo Puerto
DPD. Pérez-Brito
D. Pérez-Brito
JPJosé A. Moreno Pérez
José A. Moreno Pérez

1 December 2000 in TOP
Verified
Journal Article
Closed access
PDF file
DBDionisio Pérez Brito
Dionisio Pérez Brito
JPJosé A. Moreno Pérez
José A. Moreno Pérez