Complexity and Heuristics for the Max Cut-Clique Problem

In this paper we address a metaheuristic for an combinatorial optimization problem. For any given graph \(\mathcal {G}=(V,E)\) (where the nodes represent items and edges correlations), we want to find the clique \(\mathcal {C} \subseteq V\) such that the number of links shared between \(\mathcal {C}\) and \(V - \mathcal {C}\) is maximized. This problem is known in the literature as the Max Cut-Clique (MCC).

[1]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  Celso C. Ribeiro,et al.  Optimization by GRASP , 2016 .

[3]  Herman Aguinis,et al.  Using Market Basket Analysis in Management Research , 2012, Journal of Management.

[4]  Celso C. Ribeiro,et al.  Optimization by GRASP: Greedy Randomized Adaptive Search Procedures , 2016 .

[5]  Saïd Salhi,et al.  Handbook of Metaheuristics (2nd edition) , 2014, J. Oper. Res. Soc..

[6]  Nenad Mladenovic,et al.  Variable Neighborhood Descent , 2018, Handbook of Heuristics.

[7]  Pedro Martins,et al.  Cliques with maximum/minimum edge neighborhood and neighborhood density , 2012, Comput. Oper. Res..

[8]  Pedro Martins,et al.  Maximum cut-clique problem: ILS heuristics and a data analysis application , 2015, Int. Trans. Oper. Res..

[9]  A. Amuthan,et al.  Survey on Tabu Search meta-heuristic optimization , 2016, 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES).