1. T. Stützle, “Local search algorithms for combinatorial problems — analysis, improvements and new applications,” PhD. Thesis, Technische Univ. Darmstadt, Darmstadt (1998).
2. R. J. M. Vaessens, E. H. L. Aarts, and J. K. Lenstra, “A local search template,” Comput. Oper. Res., 25, No. 11, 969–979 (1998).
3. M. Birattari, L. Paquete, T. Stützle, and K. Varrentrapp, “Classification of metaheuristics and design of experiments for the analysis of components,” Techn. Rep., N AIDA-01-05, Techn. Univ. Darmstadt, Darmstadt (2001).
4. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: overview and conceptual comparison,” ACM Computing Surveys, 35, No. 3, 268–308 (2003).
5. M. Gendreau and J.-Y. Potvin, “Metaheuristics in combinatorial optimization,” Ann. Oper. Res., 140, No. 1, 189–213 (2005).