K. I. Aardal, C. A. Hurkens, J. K. Lenstra, and S. R. Tiourine, Algorithms for Frequency assignment Problems CWI Quaterly, vol.9, pp.1-8, 1996.

S. M. Allen, D. H. Smith, and S. Hurley, Lower Bounding Techniques for Frequency Assignment, submitted to Discrete Mathematics

S. M. Allen, D. H. Smith, S. Hurley, and S. U. Thiel, Using Lower Bounds for Minimum Span Frequency Assignment, 2nd International Conference on Metaheuristics MIC97, 1997.

D. J. Castelino, S. Hurley, and N. M. Stephens, A T abu Search Algorithm for Frequency Assignment

B. Chamaret, S. Ubeda, and J. Zerovnik, A R andomized A lgorithm for Graph Coloring Applied to Channel Allocation in Mobile Telephone Networks, Proceedings of the 6th International Conference on Operational Research K OI'96, pp.25-30

M. Duque-antn, D. Kunz, and B. Uber, Channel Assignment for Cellular Radio Using Simulated A nnealing, I E E E T ransactions on Vehicular Technology, vol.42, pp.14-21, 1993.

A. Ferreira and J. Zerovnik, Bounding the probability of succe s s o f s t o chastic methods for global optimization, Journal of computers & mathematics with applications, vol.25, pp.1-8, 1993.

M. R. Garey, D. S. Johnson, . Computers, F. Intractability, and . Reeman, , 1979.

A. I. Giortzis and L. F. Turner, A Mathematical Programming Approach to the Channel Assignement Pro b l e m i n R adio Networks, IEEE Vehicular Technology Conf, pp.736-740, 1996.

M. Grevel and A. Sachs, A G r aph Theoretical Analysis of Dynamic Channel Assignment Algorithms for Mobile Radiocommunication Systems, Siemens Forsch.-u Entwickl-Ber Bd, vol.12, issue.5, pp.298-305, 1983.

S. Hurley, D. H. Smith, and S. U. Thiel, FASoft: A Software System for frequency Assignment

S. Hurley, S. U. Thiel, and D. H. Smith, A C o m p arison of Local Search Algorithms for Radio Link Frequency Assignment Problems, 11th Annual ACM Symposium on Applied computing, pp.251-257, 1996.

F. J. Jaimes-romero and D. Munoz-rodriguez, Channel Assignment in Cellular Systems Using Genetic Algorithms, IEEE Vehicular Technology Conf, pp.741-745, 1996.

P. J. Laarhoven and E. H. Aarts, Simulating Annealing, Theory and applications, 1987.

A. Petford and D. Welsh, A R andomised 3 -c olouring Algorithm, vol.74, pp.253-261, 1989.

, Personal communication from Mauro Manela, Mobile Systems International Plc, 1 Harbour Exchange Square

J. Shawe-taylor and J. Zerovnik, Boltzmann Machines with Finite Alphabet, Artiicial Neural Networks, vol.2, pp.391-394, 1992.

J. Shawe-taylor and J. Zerovnik, Analysis of the Mean Field Annealing Algorithm for Graph Colouring, Journal of Artiicial Neural Networks, vol.2, pp.329-340, 1995.

J. Shawe-taylor and J. Zerovnik, Adapting temperature for some randomized l o cal search algorithms

P. Burge, J. Shawe-taylor, and J. Zerovnik, Graph Coloring by Maximal Evidence Edge Adding

D. H. Smith and S. Hurley, Bounds for the Frequency Assignment Problem, Discrete Mathematics, vol.167, pp.571-582, 1997.

S. Ub-eda and J. Zerovnik, A R andomized A lgorithm for a Channel Assignment Problem

S. Ub-eda and J. Zerovnik, Upper bounds for the span of a frequency assignment in triangular lattice g r aphs with blowups

R. Wilson, Introduction to Graph Theory, Longman Scientiic and Technical, 1985.

D. Youngs, Frequency Assignment for Cellular Radio Networks, the IMA Conference series (number 60) 'Applications of Combinatorial Mathematics, pp.233-241, 1995.

J. Zerovnik, A R andomized A lgorithm for k{colorability, vol.131, pp.379-393, 1994.