Resumo

MORENO RAMIREZ, Jorge. GRASP metaheuristics for the Vertex Bisection Minimization problem.. Rev cuba cienc informat [online]. 2018, vol.12, suppl.1, pp. 28-41. ISSN 2227-1899.

Given a non-oriented graph G = (V, E), where V denotes the set of vertices and E represents the set of edges, the Vertex Bisection Minimization problem consists of partitioning V into two subsets B and B1, such that |B| = l|V |/2J and minimizing the number of vertices in B that are adjacent to some vertex of B1. This problem belongs to the set of graph layout problems and has applications in areas such as network optimization, graph theory, information retrieval, etc. This problem is NP-hard on graphs in general, but polynomially soluble for trees and hypercubes. Because of its importance, various heuristic approaches have been carried out with the purpose of finding quality solutions. In this work, a GRASP metaheuristics was developed to address this problem. The experimental results show that the proposed algorithm obtains better quality results than the heuristic algorithms found in the literature for this problem.

Palavras-chave : Metaheuristics; GRASP; Vertex Bisection.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )