1. Ausiello, G., et al.: Complexity and Approximation – Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
2. Blum, C., Roli, A., Alba, E.: An introduction to metaheuristic techniques. In: Alba, E., et al. (eds.) Parallel Metaheuristics, pp. 3–42. Wiley-Interscience, New York (2005)
3. Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. Lect. Notes Comp. Sci. (2003). doi: 10.1007/978-3-540-39658-1-52
4. Byun, C.-Y.: Lower bound for large-scale set partitioning problems. ZIB-Report 12, 18–22 (2001)
5. Charon, I., Hudry, O.: Noising methods for a clique partitioning problem. Discret. Appl. Math. (2006). doi: 10.1016/j.dam.2005.05.029