1. J.E. Beasley. Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069–1072, 1990.
2. C. Cotta. On resampling in nature-inspired heuristics. In V. Botti, editor, Proceedings of the Seventh Conference of the Spanish Association for Artificial Intelligence, pages 145–154, 1997. In Spanish.
3. C. Cotta and J.M. Troya. A hybrid genetic algorithm for the 0–1 multiple knapsack problem. In G.D. Smith, N.C. Steele, and R.F. Albrecht, editors, Artificial Neural Networks and Genetic Algorithms: Proceedings of the Third International Conference, pages 251–255, Wien, 1997. Springer-Verlag.
4. D.E. Goldberg. Genetic algorithms and walsh functions: Parts i and ii. Complex Systems, 3:129–171, 1989.
5. W.E. Hart and R.K. Belew. Optimizing an arbitrary function is hard for the genetic algorithm. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 190–195, San Mateo, CA, 1991. Morgan Kaufmann.