A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem

Rafael A. Melo (), Celso C. Ribeiro () and Jose A. Riveaux ()
Additional contact information
Rafael A. Melo: Universidade Federal da Bahia
Celso C. Ribeiro: Universidade Federal Fluminense
Jose A. Riveaux: University of São Paulo

Annals of Operations Research, 2025, vol. 351, issue 1, No 22, 575-607

Abstract: Abstract Let $$G=(V, E)$$ G = ( V , E ) be a graph with vertex set V and edge set E, and consider $$\gamma \in [0,1)$$ γ ∈ [ 0 , 1 ) to be a real constant. A $$\gamma $$ γ -clique (or quasi-clique) is a subset $$V'\subseteq V$$ V ′ ⊆ V inducing a subgraph of G with edge density at least $$\gamma $$ γ . In this paper, we tackle the minimum quasi-clique partitioning problem (MQCPP), which consists of obtaining a minimum-cardinality partition of V into quasi-cliques. We propose a biased random-key genetic algorithm (BRKGA) relying on an efficient partitioning decoder that allows merge operations to combine smaller quasi-cliques into larger ones. Furthermore, we show that MQCPP and the problem of covering the graph with a minimum number of quasi-cliques are not equivalent. Computational experiments indicate that the proposed BRKGA is very effective in obtaining high-quality solutions for MQCPP in low computational times. More specifically, it can at least match all the best solutions available in the literature, strictly improving over them for 20.3% of the benchmark instances. Besides, the approach is robust as it obtains small deviations from the best-achieved solutions when executing multiple independent runs. We also consider the performance of our BRKGA on a new set of challenging large instances with up to 2851 vertices.

Keywords: Combinatorial optimization; Quasi-clique partitioning; Quasi-cliques; Biased random-key genetic algorithms; Network clustering; Metaheuristics (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05609-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:351:y:2025:i:1:d:10.1007_s10479-023-05609-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05609-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().