Back
Journal article Scopus Source The journal / series is indexed in Scopus (SCImago list). The article itself has not been verified. 10 Citations Quartil Q1

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

Martins, P. , Ladrón, A. , Ramalhinho, H.
ISLA — Instituto Politécnico de Gestão e Tecnologia
International Transactions in Operational Research, Volume 22, Issue 5, 2015, pp. 775–809
DOI: 10.1111/itor.12120

Resume

Abstract
AbstractThis 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 V\C, establishing the cut (C,V\C). 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.

Keywords

#iterated local search #approximate algorithms #undirected graphs #marketing analysis #cell biology applications #Clique problem #Clique #heuristics #Clique-sum #Mathematics #Iterated function #Clique graph

Bibliographic Details

Publication Type Journal article
Publication Year 2015
Journal / Conference / Work International Transactions in Operational Research
Volume / Issue Vol. 22 (5)
Pagination pp. 775–809
Quartile (SCImago) Q1
Scopus Indexing Indexed source (via SCImago)

ISLA Authors & Affiliations

P
Pedro João Coimbra Martins
pmartins@iscac.pt ID: 1113-BC3A-435F
Profile