Variable Neighborhood Search for the Vertex Separation Problem

The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or t...

Descripción completa

Detalles Bibliográficos
Autores: Duarte, Abraham, Escudero, Laureano F., Martí, Rafael, Mladenovic, Nenad, Pantrigo, Juan José, Sánchez-Oro, Jesús
Tipo de recurso: artículo
Fecha de publicación:2012
País:España
Institución:Universidad Rey Juan Carlos
Repositorio:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
OAI Identifier:oai:dnet:burjcdigital::234c1af01dacaa5e1f46e0f5bdb8cf1f
Acceso en línea:http://hdl.handle.net/10115/12378
Access Level:acceso abierto
Palabra clave:Informática
Estadística y Demografía
Combinatorial Optimization
Metaheuristics
Variable Neigborhood Search
Layout Problems
1203.17 Informática
52 Demografía
5207.10 Estadísticas de Poblaciones
id ES_3786febfa347d8223055c4caadc1d8d3
oai_identifier_str oai:dnet:burjcdigital::234c1af01dacaa5e1f46e0f5bdb8cf1f
network_acronym_str ES
network_name_str España
repository_id_str
spelling Variable Neighborhood Search for the Vertex Separation ProblemDuarte, AbrahamEscudero, Laureano F.Martí, RafaelMladenovic, NenadPantrigo, Juan JoséSánchez-Oro, JesúsInformáticaEstadística y DemografíaCombinatorial OptimizationMetaheuristicsVariable Neigborhood SearchLayout Problems1203.17 Informática52 Demografía5207.10 Estadísticas de PoblacionesThe vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these problems have been ignored from a heuristic perspective, as far as we know. In this paper we propose a pure 0-1 optimization model and a metaheuristic algorithm based on the variable neighborhood search methodology for the vertex separation problem on general graphs. Computational results show that small instances can be optimally solved with this optimization model and the proposed metaheuristic is able to nd high-quality solutions with a moderate computing time for large-scale instances.Ciencias de la ComputaciónElsevier201420142012info:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10115/12378reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlosinstname:Universidad Rey Juan CarlosInglésS2009/TIC-1542Atribución-NoComercial-SinDerivadas 3.0 Españahttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:dnet:burjcdigital::234c1af01dacaa5e1f46e0f5bdb8cf1f2025-07-24T13:39:12Z
dc.title.none.fl_str_mv Variable Neighborhood Search for the Vertex Separation Problem
title Variable Neighborhood Search for the Vertex Separation Problem
spellingShingle Variable Neighborhood Search for the Vertex Separation Problem
Duarte, Abraham
Informática
Estadística y Demografía
Combinatorial Optimization
Metaheuristics
Variable Neigborhood Search
Layout Problems
1203.17 Informática
52 Demografía
5207.10 Estadísticas de Poblaciones
title_short Variable Neighborhood Search for the Vertex Separation Problem
title_full Variable Neighborhood Search for the Vertex Separation Problem
title_fullStr Variable Neighborhood Search for the Vertex Separation Problem
title_full_unstemmed Variable Neighborhood Search for the Vertex Separation Problem
title_sort Variable Neighborhood Search for the Vertex Separation Problem
dc.creator.none.fl_str_mv Duarte, Abraham
Escudero, Laureano F.
Martí, Rafael
Mladenovic, Nenad
Pantrigo, Juan José
Sánchez-Oro, Jesús
author Duarte, Abraham
author_facet Duarte, Abraham
Escudero, Laureano F.
Martí, Rafael
Mladenovic, Nenad
Pantrigo, Juan José
Sánchez-Oro, Jesús
author_role author
author2 Escudero, Laureano F.
Martí, Rafael
Mladenovic, Nenad
Pantrigo, Juan José
Sánchez-Oro, Jesús
author2_role author
author
author
author
author
dc.subject.none.fl_str_mv Informática
Estadística y Demografía
Combinatorial Optimization
Metaheuristics
Variable Neigborhood Search
Layout Problems
1203.17 Informática
52 Demografía
5207.10 Estadísticas de Poblaciones
topic Informática
Estadística y Demografía
Combinatorial Optimization
Metaheuristics
Variable Neigborhood Search
Layout Problems
1203.17 Informática
52 Demografía
5207.10 Estadísticas de Poblaciones
description The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these problems have been ignored from a heuristic perspective, as far as we know. In this paper we propose a pure 0-1 optimization model and a metaheuristic algorithm based on the variable neighborhood search methodology for the vertex separation problem on general graphs. Computational results show that small instances can be optimally solved with this optimization model and the proposed metaheuristic is able to nd high-quality solutions with a moderate computing time for large-scale instances.
publishDate 2012
dc.date.none.fl_str_mv 2012
2014
2014
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10115/12378
url http://hdl.handle.net/10115/12378
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv S2009/TIC-1542
dc.rights.none.fl_str_mv Atribución-NoComercial-SinDerivadas 3.0 España
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución-NoComercial-SinDerivadas 3.0 España
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
instname:Universidad Rey Juan Carlos
instname_str Universidad Rey Juan Carlos
reponame_str BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
collection BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1844182360006852608
score 15.647109

Similares en LA Referencia