1. Aardal, K. I., van Hoesel, C. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2003). Models and solution techniques for the frequency assignment problem. 4OR: Operational Research Quarterly, 1(4), 261–317 (An updated version to appear in Annals of Operations Research is available at http://fap.zib.de/download/fap2007.ps.gz ).
2. Allen, S. M., Smith, D. H., & Hurley, S. (1999). Lower bounding techniques for frequency assignment. Discrete Mathematics, 197-198, 41–52.
3. Anderson, L. G. (1973). A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications, 21, 1294–1301.
4. Bartz-Beielstein, T., & Markon, S. (2004). Tuning search algorithms for real-world applications: A regression tree based approach. In Congress on evolutionary computation (CEC’04) (pp. 1111–1118). Piscataway NJ: IEEE Press.
5. Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In W. B. Langdon, et al. eds., Proceedings of the genetic and evolutionary computation conference (GECCO-2002) (pp. 11–18). San Francisco, CA: Morgan Kaufmann.