메뉴 건너뛰기




Volumn 91, Issue 2, 2002, Pages 357-374

Minimizing the span of d-walks to compute optimum frequency assignments

Author keywords

Minimum span frequency assignment problem; Radio network design; Telecommunication systems

Indexed keywords

ALGORITHMS; BANDWIDTH; BENCHMARKING; PROBLEM SOLVING; SIGNAL INTERFERENCE; TELECOMMUNICATION SYSTEMS;

EID: 3242657867     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100247     Document Type: Article
Times cited : (11)

References (38)
  • 2
    • 0002851467 scopus 로고    scopus 로고
    • Lower bounding techniques for frequency assignment
    • Allen, S.M., Smith, D.H., Hurley, S. (1999): Lower bounding techniques for frequency assignment. Discrete Math. 197/198, 41-52
    • (1999) Discrete Math. , vol.197-198 , pp. 41-52
    • Allen, S.M.1    Smith, D.H.2    Hurley, S.3
  • 4
    • 0015681213 scopus 로고
    • A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system
    • Anderson, L.G. (1973): A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Trans. Commun. 21, 1294-1301
    • (1973) IEEE Trans. Commun. , vol.21 , pp. 1294-1301
    • Anderson, L.G.1
  • 5
    • 0035268622 scopus 로고    scopus 로고
    • A randomized saturation degree heuristic for channel assignment in cellular radio networks
    • Battiti, R., Bertossi, A., Cavallaro, D. (2001): A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Transactions on Vehicular Technology 50(2), 364-374
    • (2001) IEEE Transactions on Vehicular Technology , vol.50 , Issue.2 , pp. 364-374
    • Battiti, R.1    Bertossi, A.2    Cavallaro, D.3
  • 9
    • 21344441369 scopus 로고    scopus 로고
    • A tabu search algorithm for frequency assignment
    • Castelino, D.J., Hurley, S., Stephens, N.M. (1996): A tabu search algorithm for frequency assignment. Ann. Oper. Res. 63, 301-319
    • (1996) Ann. Oper. Res. , vol.63 , pp. 301-319
    • Castelino, D.J.1    Hurley, S.2    Stephens, N.M.3
  • 10
    • 21144483217 scopus 로고
    • On the use of some known methods for T-colourings of graphs
    • Costa, D. (1993): On the use of some known methods for T-colourings of graphs. Ann. Oper. Res. 41, 343-358
    • (1993) Ann. Oper. Res. , vol.41 , pp. 343-358
    • Costa, D.1
  • 12
    • 0027543819 scopus 로고
    • Channel assignment for cellular radio using simulated annealing
    • Duque-Antó, M., Kunz, D., Rüber, B. (1993): Channel assignment for cellular radio using simulated annealing. IEEE Trans. Vehicular Technol. 42, 14-21
    • (1993) IEEE Trans. Vehicular Technol. , vol.42 , pp. 14-21
    • Duque-Antó, M.1    Kunz, D.2    Rüber, B.3
  • 13
    • 0033880603 scopus 로고    scopus 로고
    • Frequency assignment in mobile radio systems using branch-and-cut techniques
    • Fischetti, M., Lepschy, C., Minerva, G., Jacur, G.R., Toto, E. (2000): Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur. J. Oper. Res. 123, 241-255
    • (2000) Eur. J. Oper. Res. , vol.123 , pp. 241-255
    • Fischetti, M.1    Lepschy, C.2    Minerva, G.3    Jacur, G.R.4    Toto, E.5
  • 14
    • 0004833055 scopus 로고
    • A neural network algorithm for channel assignments in cellular radio networks
    • Funabiki, N., Takefuji, Y. (1991): A neural network algorithm for channel assignments in cellular radio networks. IEEE Trans. Vehicular Technol. 40, 14-21
    • (1991) IEEE Trans. Vehicular Technol. , vol.40 , pp. 14-21
    • Funabiki, N.1    Takefuji, Y.2
  • 15
    • 0022665248 scopus 로고
    • Some lower bounds for a class of frequency assignment problems
    • Gamst, A. (1986): Some lower bounds for a class of frequency assignment problems. IEEE Trans. Vehicular Technol. 35, 8-14
    • (1986) IEEE Trans. Vehicular Technol. , vol.35 , pp. 8-14
    • Gamst, A.1
  • 16
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading
    • Harary, F. (1969): Graph Theory. Addison-Wesley, Reading
    • (1969) Graph Theory
    • Harary, F.1
  • 17
    • 33750967497 scopus 로고    scopus 로고
    • Heller, H.: Result available at http://fap.zib.de/problems/Philadelphia/
    • Heller, H.1
  • 18
    • 0000997556 scopus 로고    scopus 로고
    • A comparison of local search algorithms for radio link frequency assignment problems
    • Hurley, S., Smith, D.H., Thiel, S.U. (1996): A comparison of local search algorithms for radio link frequency assignment problems. ACM Symposium on Applied Computing, pp. 251-257
    • (1996) ACM Symposium on Applied Computing , pp. 251-257
    • Hurley, S.1    Smith, D.H.2    Thiel, S.U.3
  • 19
    • 0031233009 scopus 로고    scopus 로고
    • FASoft: A system for discrete channel frequency assignment
    • Hurley, S., Smith, D.H., Thiel, S.U. (1997): FASoft: a system for discrete channel frequency assignment. Radio Sci. 32, 1921-1939
    • (1997) Radio Sci. , vol.32 , pp. 1921-1939
    • Hurley, S.1    Smith, D.H.2    Thiel, S.U.3
  • 21
    • 0028493555 scopus 로고
    • A two-phase algorithm for frequency assignment in cellular mobile systems
    • Kim, S., Kim, S.-L. (1994): A two-phase algorithm for frequency assignment in cellular mobile systems. IEEE Trans. Vehicular Technol. 43, 542-548
    • (1994) IEEE Trans. Vehicular Technol. , vol.43 , pp. 542-548
    • Kim, S.1    Kim, S.-L.2
  • 24
    • 0032178207 scopus 로고    scopus 로고
    • The partial constraint satisfaction problem: Facets and lifting theorems
    • Koster, A.M.C.A., van Hoesel, C.P.M., Kolen, A.W.J. (1998): The partial constraint satisfaction problem: facets and lifting theorems. Oper. Res. Lett. 23(3-5), 89-97
    • (1998) Oper. Res. Lett. , vol.23 , Issue.3-5 , pp. 89-97
    • Koster, A.M.C.A.1    Van Hoesel, C.P.M.2    Kolen, A.W.J.3
  • 25
    • 0026103220 scopus 로고
    • Channel assignment for cellular radio using neural networks
    • Kunz, D. (1991): Channel assignment for cellular radio using neural networks. IEEE Trans. Vehicular Technol. 40, 188-193
    • (1991) IEEE Trans. Vehicular Technol. , vol.40 , pp. 188-193
    • Kunz, D.1
  • 26
    • 33751002188 scopus 로고    scopus 로고
    • Tiling methods for channel assignment in radio communication networks
    • Leese, R. (1996): Tiling methods for channel assignment in radio communication networks. In: 3rd ICIAM Congress
    • (1996) 3rd ICIAM Congress
    • Leese, R.1
  • 27
    • 0029227613 scopus 로고
    • Channel assignment using a subspace approach to neural networks
    • Lochtie, G.D., Mehler, M.J. (1995): Channel assignment using a subspace approach to neural networks. In: IEE Conference Publication 407, 296-300
    • (1995) IEE Conference Publication , vol.407 , pp. 296-300
    • Lochtie, G.D.1    Mehler, M.J.2
  • 32
    • 0000789601 scopus 로고    scopus 로고
    • Bounds for the frequency assignment problem
    • Smith, D.H., Hurley, S. (1997): Bounds for the frequency assignment problem. Discrete Math. 167/168, 571-582
    • (1997) Discrete Math. , vol.167-168 , pp. 571-582
    • Smith, D.H.1    Hurley, S.2
  • 34
    • 0032070963 scopus 로고    scopus 로고
    • Improving heuristics for the frequency assignment problem
    • Smith, D.H., Hurley, S., Thiel, S.U. (1998): Improving heuristics for the frequency assignment problem. Eur. J. Oper. Res. 107, 76-86
    • (1998) Eur. J. Oper. Res. , vol.107 , pp. 76-86
    • Smith, D.H.1    Hurley, S.2    Thiel, S.U.3
  • 35
    • 0031211647 scopus 로고    scopus 로고
    • Sequential packing algorithm for channel assignment under cochannel and adjacent channel interference constraint
    • Sung, C.W., Wong, W.S. (1997): Sequential packing algorithm for channel assignment under cochannel and adjacent channel interference constraint. IEEE Trans. Vehicular Technol. 46, 676-685
    • (1997) IEEE Trans. Vehicular Technol. , vol.46 , pp. 676-685
    • Sung, C.W.1    Wong, W.S.2
  • 36
    • 0031079526 scopus 로고    scopus 로고
    • A new lower bound for the frequency assignment problem
    • Tcha, D., Chung, Y., Choi, T. (1997): A new lower bound for the frequency assignment problem. IEEE/ACM Trans. Networking 5, 34-39
    • (1997) IEEE/ACM Trans. Networking , vol.5 , pp. 34-39
    • Tcha, D.1    Chung, Y.2    Choi, T.3
  • 37
    • 84878536059 scopus 로고    scopus 로고
    • A permutation based genetic algorithm for minimum span frequency assignment
    • Valenzuela, C., Hurley, S., Smith, D.H. (1998): A permutation based genetic algorithm for minimum span frequency assignment. Lecture Notes in Computer Science 1498, 907-916
    • (1998) Lecture Notes in Computer Science , vol.1498 , pp. 907-916
    • Valenzuela, C.1    Hurley, S.2    Smith, D.H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.