If you know any other paper that should be listed here, please send me an email.
D.V. Andrade, M.G.C. Resende and R.F. Werneck. Fast local search for the maximum independent set problem. AT&T Labs Research Technical Report TD-7BBST2, 2008.
J. Kratica, V. Kovacevic-Vujcic, M. Cangalovic. Computing the metric dimension of graphs by genetic algorithms, Computational Optimization and Applications, to appear. doi:10.1007/s10589-007-9154-5
A. Grosso, M. Locatelli, W. J. Pullan. Simple ingredients leading to very efficient heuristics for the maximum clique problem. Journal of Heuristics, to appear. doi:10.1007/s10732-007-9055-x
Wayne Pullan. Approximating the maximum vertex/edge weighted clique using local search. Journal of Heuristics, 2007. doi:10.1007/s10732-007-9026-2
M. Pelikan, R. Kalapala, A.K. Hartmann: Hybrid evolutionary algorithms on minimum vertex cover for random graphs. GECCO 2007: 547-554.
H. Potrzebowski, J. Stanczak, K. Scep. Separable Decomposition of Graph Using α-cliques. Computer Recognition Systems 2 (Advances in Soft Computing), 2007.
F. Brglez, J.A. Osborne. Performance testing of combinatorial solvers with isomorph class instances. In: Proceedings of the 2007 workshop on Experimental computer Science.
Silvia Richter, Malte Helmert and Charles Gretton. A Stochastic Local Search Approach to Vertex Cover. In: Proceedings of the 30th German Conference on Artificial Intelligence (KI-2007), 2007
Stephen Gilmour and Mark Dras. Exactness as Heuristic Structure for Guiding Ant Colony Optimization. Technical Report. Macquarie University, Department of Computing. Sydney, Australia, 2006.
Stephen Gilmour and Mark Dras. Kernelization as Heuristic Structure for the Vertex Cover Problem. Third Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2006). Brussels, Belgium.