The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut Eâ€² of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in Eâ€² is minimum. In this work, we present two approaches based on Variable Neighborhood Search to solve thisâ€¦ (More)