Efficient heuristics for the minimum labeling global cut problem.

Let G=(V,E,L) be an edge-labeled graph. Let V be the set of vertices of G, E the set of edges, L the set of labels (colors) such that each edge e∈E has an associated label L(e). The goal of the minimum labeling global cut problem (MLGCP) is to find a subset L′⊆L of labels such that G′=(V,E′,L\L′) is not connected and |L′| is minimized. In this work, we generate random instances for the MLGCP to perform empirical tests. Also propose a set of heuristics using concepts of Genetic Algorithm and metaheuristic VNS, including some of their procedures, like two local search moves, and an auxiliary data structure to speed up the local search. Computational experiments show that the metaheuristic VNS outperforms other methods with respect to solution quality.