Sánchez-Oro, JesúsDuarte, Abraham2014-05-282014-05-282012An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems Sanchez-Oro J., Duarte A. (2012) Electronic Notes in Discrete Mathematics, 39 , pp. 59-66.1571-0653http://hdl.handle.net/10115/12380Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. This paper reviews three VNS strategies for finding near-optimal solutions for vertex-cut minimization problems. Specifically, we consider the min-max variant (Vertex Separation Problem) and the min-sum variant (SumCut Minimization Problem). We also present an preliminary computational comparison of the methods on previously reported instances.engAtribución-NoComercial-SinDerivadas 3.0 Españahttp://creativecommons.org/licenses/by-nc-nd/3.0/es/InformáticaCiencias de la ComputaciónVNSProfileVertex SeparationmetaheuristicAn experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problemsinfo:eu-repo/semantics/article10.1016/j.endm.2012.10.009info:eu-repo/semantics/openAccess3304.06 Arquitectura de Ordenadores1203.17 Informática