Hansen 1997 caa

<bibtex> @article{hansen1997caa,

 title=Template:Cluster analysis and mathematical programming,
 author={Hansen, P. and Jaumard, B.},
 journal={Mathematical programming},
 volume={79},
 number={1},
 pages={191--215},
 year={1997},
 publisher={Springer}

} </bibtex>

Thick review from the computer science community on clusering algorithms. At the very end it has a few pages dedicated to heuristic techniques where my interests presumably lie.

"For many criteria, exact solution of large clustering problems is out of reach. So there is room for heuristics. Moreover, finding a good initial solution may be important in column generation (if it is well exploited..). " Meta heuristics have the most luck, sim annealing, Tabu and GAs. Also the Variable Neighborhood Search is one they recommended.