A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy

DOI10.1051/ro/2020003zbMath1469.05135OpenAlexW2999572838MaRDI QIDQ5002257

Bruno Q. Pinto, José A. Riveaux, Isabel Rosseti, Celso Carneiro Ribeiro

Publication date: 27 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2020003

zbMATH Keywords

metaheuristicsmaximum clique problemmatheuristicsbiased random-key genetic algorithmmaximum quasi-clique problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items (2)

MIP formulations for induced graph optimization problems: a tutorial ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study

This page was built for publication: A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy