Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem
暂无分享,去创建一个
[1] Derek H. Smith,et al. A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment , 1998, PPSN.
[2] Jin-Kao Hao,et al. Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings , 1999 .
[3] D. H. Smith,et al. Bounds for the frequency assignment problem , 1997, Discret. Math..
[4] L. G. Anderson. A Simulation Study of Some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications System , 1973, IEEE Trans. Commun..
[5] Jin-Kao Hao,et al. Tabu Search for Frequency Assignment in Mobile Radio Networks , 1998, J. Heuristics.
[6] Ulrich Killat,et al. A new strategy for the application of genetic algorithms to the channel-assignment problem , 1999 .
[7] Derek H. Smith,et al. Frequency assignment with complex co-site constraints , 2001 .
[8] A. Gamst,et al. Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.
[9] Stuart M. Allen,et al. Lower bounding techniques for frequency assignment , 1999 .
[10] S. U. Thiel,et al. FASoft: A system for discrete channel frequency assignment , 1997 .
[11] Derek H. Smith,et al. Channel assignment in cellular networks without channel separation constraints , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).
[12] Derek H. Smith,et al. Improving heuristics for the frequency assignment problem , 1998, Eur. J. Oper. Res..