Local search algorithms for the radio link frequency assignment problem

Telecommunication Systems

Volumn 13, Issue 2-4, 2000, Pages 293-314

  Tiourine, S R ^a   Hurkens, C A J ^a   Lenstra, J K ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044521217     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. K. Aardal, C.A.J. Hurkens, J.K. Lenstra and S.R. Tiourine, Algorithms for frequency assignment problems, CWI Quarterly 9 (1996) 1-8.
2. E.H.L. Aarts and J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Networks (Wiley, Chichester, UK, 1989).
3. E.H.L. Aarts and J.K. Lenstra, eds., Local Search in Combinatorial Optimization (Wiley, Chichester, UK, 1997).
4. E. Balas and A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Management Science 44 (1998) 262-275.
5. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1976).
6. J.R. Bitner, G. Ehrlich and E.M. Reingold, Efficient generation of the binary reflected Gray code and its applications, Communications of the ACM 9 (1976) 517-521.
7. D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM 16 (1973) 575-577.
8. F. Glover and M. Laguna, Tabu Search (Kluwer Academic, Boston, 1997).
9. T.T. Ha, Digital Satellite Communications (McGraw-Hill, New York, 1990).
10. W. Hajema, M. Minoux and C. West, Statement of the radio link frequency assignment problem, Technical Report, Request for proposals on the CALMA project (1993).
11. W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68 (1980) 1497-1514.