Variable neighborhood search for the maximum clique

Citations of this article
Mendeley users who have this article in their library.


Maximum clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic variable neighborhood search heuristic for maximum clique that combines greedy with the simplicial vertex test in its descent step is proposed and tested on standard test problems from the literature. Despite its simplicity, the proposed heuristic outperforms most of the well-known approximate solution methods. Moreover, it gives solution of equal quality to those of the state-of-the-art heuristic of Battiti and Protasi in half the time. © 2004 Published by Elsevier B.V.




Hansen, P., Mladenović, N., & Urošević, D. (2004). Variable neighborhood search for the maximum clique. In Discrete Applied Mathematics (Vol. 145, pp. 117–125). Elsevier.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free