1. Ackley, D. H. (1987). A Connectionist Machine for Genetic Hill Climbing. Kluwer, Boston, MA
2. Albert, L. A. (2001). Efficient genetic algorithms using discretization scheduling. Master’s thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL
3. Albert, L. A. and Goldberg, D. E. (2001). Efficient evaluation relaxation under integrated fitness functions. Intelligent Engineering Systems Through Artificial Neural Networks, 11:165-170.(Also IlliGAL Report No. 2001024)
4. Albert, L. A. and Goldberg, D. E. (2002). Efficient discretization scheduling in multiple dimensions. Proceedings of the Genetic and Evolutionary Computation Conference, pages 271-278. (Also IlliGAL Report No. 2002006)
5. Armstrong, D. E. and Jacobson, S. H. (2005). Data independent neighborhood functions and strict local optima. Discrete Applied Mathematics, 146(3):233-243