Maximum cut-clique problem: ILS heuristics and a data analysis application

摘要

This paper focuses on iterated local search heuristics for the maximum cut-clique (MCC, or clique neighborhood) problem. Given an undirected graph G = (V,E) and a clique C of G, the cut-clique is the set of edges running between C and VC, establishing the cut (C,VC). The MCC in G is to find a clique with the largest number of edges in the neighborhood of the clique, also known as the maximum edge-neighborhood clique. This problem has been recently introduced in the literature together with a number of applications, namely, in cell biology instances. However, it has only been addressed so far by exact methods. In this paper, we introduce the first approximate algorithms for tackling the MCC problem, compare the results with the exact methodologies, and explore a new application within marketing analysis, which provide a new alternative perspective for mining market basket problems.