1. Aida, K., & Osumi, T. (2005). A case study in running a parallel branch and bound application on the grid, (pp. 164–173). USA: IEEE Computer Society, Washington, DC.
2. Aiex, R., Resende, M., Ribeiro, C. (2002). Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics, 8(3), 343–373.
3. Aiex, R., Resende, M., Ribeiro, C. (2007). TTT plots: a Perl program to create time-to-target plots. Optimization Letters, 1, 355–366.
4. Alava, M., Ardelius, J., Aurell, E., Kaski, P., Orponen, P., Krishnamurthy, S., Seitz, S. (2007). Circumspect descent prevails in solving random constraint satisfaction problems. PNAS, 105(40)(15), 253–257.
5. Alba, E. (2004). Special issue on new advances on parallel meta-heuristics for complex problems. J. Heuristics, 10(3), 239–380.