Variable neighborhood search for the Vertex Separation Problem

Abstract

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.

Topics

12 Figures and Tables

Download Full PDF Version (Non-Commercial Use)