A variable neighborhood search heuristic for the maximum ratio clique problem

DOI10.1016/j.cor.2017.01.010zbMath1391.90655MaRDI QIDQ1652431

Mahdi Moeini, Dominik Goeke, David Poganiuch

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.010

zbMATH Keywords

heuristic; metaheuristic; variable neighborhood search; maximal clique; maximum ratio clique problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Uses Software

• Algorithm 457