An enumerative algorithm for the frequency assignment problem

Discrete Applied Mathematics

Volumn 129, Issue 1, 2003, Pages 155-169

  Mannino, Carlo ^a   Sassano, Antonio ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Frequency assignment; Telecommunication systems

Indexed keywords

EID: 84867970586     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00239-1     Document Type: Conference Paper

References (20)

1. K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, G. Jansen, A branch-and-cut algorithm for the frequency assignment problem, http://ftp.win.tue.nl/pub/ techreports/CALMA/index.html, 1998.
2. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. vom Scheidt, J.G. Taylor, Tabu search for the radio links frequency assignment problem, in: Proceedings of the Conference on Applied Decision Technologies: Modern Heuristic Methods, Brunel University, 1995, pp. 233-250.
3. D.J. Castelino, S. Hurley, and N.M. Stephens A tabu search algorithm for frequency assignment Ann. Oper. Res. 63 1996 301 319
4. D. Costa On the use of some known methods for T-colourings of graphs Ann. Oper. Res. 41 1993 343 358
5. W. Crompton, S. Hurley, N.M. Stephens, A parallel genetic algorithm for frequency assignment problems, in: Proceedings of the IMACS/IEEE Conference on Signal Processing, Robotics and Neural Networks, Lille, France, 1994, pp. 81-84.
6. M. Duque-Anton, D. Kunz, and B. Ruber Channel assignment for cellular radio using simulated annealing IEEE Trans. Vehicular Technol. 42 1993 14 21
7. M. Fischetti, C. Lepschy, G. Minerva, G. Romanin-Jacur, E. Toto, Frequency assignment in mobile radio systems using branch-and-cut techniques, Eur. J. Op. Res. 123 (2000) 241-255.
8. A. Gamst Some lower bounds for a class of frequency assignment problems IEEE Trans. Vehicular Technol. 35 1986 8 14
9. F. Glover, M. Parker, and J. Ryan Coloring by tabu branch and bound D.S. Johnson, M.A. Trick, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge Discrete Mathematics and Theoretical Computer Science Vol. 26 1996 American Mathematical Society Providence, RI 285 307
10. M.K. Goldberg, and R.D. Rivenburgh Constructing cliques using restricted backtracking D.S. Johnson, M.A. Trick, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge Discrete Mathematics and Theoretical Computer Science Vol. 26 1996 American Mathematical Society Providence, RI 285 307
11. W.K. Hale Frequency assignment: theory and applications Proc. IEEE 68 1980 1497 1514
12. S. Hurley, S.U. Thiel, D.H. Smith, A comparison of local search algorithms for radio link frequency assignment problems, in: ACM Symposium on Applied Computing, Philadelphia, 1996, pp. 251-257.
13. J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (I) Tours, Technical Report CDAM-96-17, London School of Economics, and on 1996.
14. S. Kim, and S.-L. Kim A two phase algorithm for frequency assignment in cellular mobile systems IEEE Trans. Vehicular Technol. 43 1994 542 548
15. D. Kunz Channel assignment for cellular radio using neural networks IEEE Trans. Vehicular Technol. 40 1 1991 188 193
16. R. Leese, Tiling methods for channel assignment in radio communication networks, in: Proceedings of the Third ICIAM Congress, 1996.
17. G.D. Lochtie, M.J. Mehler, Channel assignment using a subspace approach to neural networks, IEE Antennas Propagation (1995) 296-300.
18. E.C. Sewell An improved algorithm for exact graph coloring D.S. Johnson, M.A. Trick, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge Discrete Mathematics and Theoretical Computer Science Vol. 26 1996 American Mathematical Society Providence, RI 359 372
19. D.H. Smith, and S. Hurley Bounds for the frequency assignment problem Discrete Math. 167/168 1997 571 582
20. D.H. Smith, S. Hurley, and S.U. Thiel Improving heuristics for the frequency assignment problem Eur. J. Oper. Res. 107 1998 76 86