1. Balas, E., Ceria, S. and Cornuéjols, G., 1993, A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58, 295–324.
2. Beckers, R., Deneubourg, J.L. and Goss, S., 1992, Trails and U-turns in the selection of the shortest path by the ant Lasius niger. J. Theor. Bio., 159, 397–415.
3. Bersini, H., Oury, C. and Dorigo, M., 1995, Hybridization of Genetic Algorithms. Tech. Rep. No. IRIDIA 95-22, IRIDIA, Université Libre de Bruxelles, Belgium.
4. Bolondi, M. and Bondanza, M., 1993, Parallelizzazione di un algoritmo per la risoluzione del problema del commesso viaggiatore. Masters thesis, Politecnico di Milano, Italy.
5. Croes, G.A., 1958, A method for solving traveling salesman problems. Oper. Res., 6, 791–812.