A continuous based heuristic for the maximum clique problem
L. Gibbons, Donald W. Hearn, Pãnos M. Pardalos · DIMACS series in discrete mathematics and theoretical computer science · 1996
We develop a deterministic heuristic based on a continuous quadratic nonconvex formulation of the maximum clique problem. The developed heuristic avoids the need for the calibration of parameters while maintaining computational competitiveness to greedy randomized search procedures which require such calibration. Furthermore it demonstrates the potential for using continuous approaches to model discrete problems. Experimental results on test problems.