SEARCH

SEARCH BY CITATION

References

  • Anderson, L. G., A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system, IEEE Trans. Commun., COM-21, 12941301, 1973.
  • Bouju, A., J. F. Boyce, C. H. D. Dimitropoulos, G. vom Scheidt, J. G. Taylor, Tabu search for the radio links frequency assignment problem, Conference on Applied Decision Technologies: Modern Heuristic Methods, 233250Brunel Univ., Uxbridge, England, 1995.
  • Costa, D., On the use of some known methods for T-colourings of graphs, Ann. Oper. Res., 41, 343358, 1993.
  • Cozzens, M. B., F. S. Roberts, T-colorings of graphs and the channel assignment problem, Congr. Numer., 35, 191208, 1982.
  • Cozzens, M. B., D.-I. Wang, The general channel assignment problem, Congr. Numer., 41, 115129, 1984.
  • Crompton, W., S. Hurley, N. M. Stephens, Frequency assignment using a parallel genetic algorithm, Natural Algorithms for Signal Processing, 2, 26/126/8, Inst. of Electr. Eng., London, 1993.
  • Funabiki, N., Y. Takefuji, A neural network parallel algorithm for channel assignment problems in cellular radio networks, IEEE Trans. Veh. Technol., 41, 430437, 1992.
  • Gamst, A., Some lower bounds for a class of frequency assignment problems, IEEE Trans. Veh. Technol., 35, 814, 1986.
  • Glover, F., Heuristics for integer programming using surrogate constraints, Decis. Sci., 8, 156166, 1977.
  • Glover, F., E. Taillard, D. deWerra, A user's guide to tabu search, Ann. Oper. Res., 41, 328, 1993.
  • Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, Mass., 1989.
  • Hale, W. K., Frequency assignment: Theory and applications, Proc. IEEE, 68, 14971514, 1980.
  • Hale, W. K., New spectrum management tools, Electromatic Compatibility Record, 4753, IEEE Press, Piscataway, N. J., 1981.
  • Holland, J. H., Adaption in Natural and Artificial Systems, Univ. of Mich. Press, Ann Arbor, 1975.
  • Hurley, S., D. H. Smith, Fixed spectrum frequency assignment using natural algorithms, Genetic Algorithms in Engineering Systems, 373378, Inst. of Electr. Eng., London, 1995.
  • Hurley, S., S. U. Thiel, D. H. Smith, A comparison of local search algorithms for radio link frequency assignment problems, ACM Symposium on Applied Computing, 251257Assoc. for Comput. Mach., New York, 1996.
  • Janssen, J., K. Kilakos, Polyhedral analysis of channel assignment problems, I, ToursTechn. Rep. CDAM-96-17London Sch. of Econ., London, 1996.
  • Kirkpatrick, S., C. D. Gelatt, andM. D. Vecchi, Optimization by simulated annealing,Science,220(4598),671680,May1983.
  • Kruskal, J. B., On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. Am. Math. Soc., 7, 4850, 1956.
  • Kunz, D., Channel assignment for cellular radio using neural networks, IEEE Trans. Veh. Technol., 40, 188193, 1991.
  • Lai, W. K., G. G. Coghill, Channel assignment through evolutionary optimization, IEEE Trans. Veh. Technol., 45, 9195, 1996.
  • Lanfear, T. A., Graph theory and radio frequency assignment, technical reportNATO EMC Anal. Proj. 5NATO Headquarters, Brussels, 1989.
  • Leese, R., Tiling methods for channel assignment in radio communication networks3rd ICIAM CongressInt. Congr. for Ind. and Appl. Math.Hamburg, Germany, 1996.
  • Leese, R., A unified approach to the assignment of radio channels on regular hexagonal grid, IEEE Trans. Veh. Technol., 1997.
  • Lochtie, G. D., M. J. Mehler, Channel assignment using a subspace approach to neural networks, Antennas and Propagation, 296300, Inst. of Electr. Eng., London, 1995.
  • Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equations of state calculations by fast computing machines, J. Chem. Phys., 216, 10871092, 1953.
  • Prosser, P., Hybrid algorithms for the constraint satisfaction problem, Comput. Intell., 93, 268299, 1993.
  • Roberts, F. S., T-colorings of graphs: Recent results and open problems, Discrete Math., 93, 229245, 1991.
  • Sivarajan, K. N., R. J. McEliece, J. W. Ketchum, Channel assignment in cellular radio, 39th Conference on Vehicular Technol, 846850IEEE Press, Piscataway, N. J., 1989.
  • Smith, D. H., S. Hurley, Bounds for the frequency assignment problem, Discrete Math., 167/168, 571582, 1997.
  • Smith, D. H., S. Hurley, S. U. Thiel, Improving heuristics for the frequency assignment problem, Eur. J. Oper. Res., 1997.
  • Smith, G. D., A. Kapsalis, V. J. Rayward-Smith, A. Kolen, Implementation and testing of genetic algorithm approaches, technical report, EUCLID CALMA Radio Link Frequency Assignment ProjectReport 2.1:Dep. of Comput. Sci., Univ. of East Anglia, Norwich, England, 1995.
  • Volgenant, T., R. Jonker, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, Eur. J. Operational Res., 9, 8389, 1982.
  • Wang, W., C. Rushforth, An adaptive local search algorithm for the channel assignment problem (cap), IEEE Trans. Veh. Technol., 45, 459466, 1996.
  • Zoellner, J. A., C. L. Beall, A breakthrough in spectrum conserving frequency assignment technology, IEEE Trans. Electromagn. Compat., EMC-19, 313319, 1977.