Authors: Duarte, Abraham
Escudero, Laureano
Martí, Rafael
Mladenović, Nenad 
Pantrigo, Juan José
Sánchez-Oro, Jesús
Title: Variable neighborhood search for the vertex separation problem
Journal: Computers and Operations Research
Volume: 39
Issue: 12
First page: 3247
Last page: 3255
Issue Date: 1-Dec-2012
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.04.017
Abstract: 
The Vertex Separation Problem belongs to a family of optimization problems in which the objective is to find 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 pract...
Keywords: Combinatorial optimization | Layout problems | Metaheuristics | Variable neigborhood search
Publisher: Elsevier
Project: Spanish Ministry of Science and Innovation, Grants TIN2009-07516 and TIN2011-28151
Government of the Community of Madrid, grant S2009/TIC-1542

Show full item record

SCOPUSTM   
Citations

45
checked on Apr 3, 2025

Page view(s)

22
checked on Jan 31, 2025

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.