{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:34:34Z","timestamp":1772516074686,"version":"3.50.1"},"reference-count":155,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T00:00:00Z","timestamp":1178928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T00:00:00Z","timestamp":1178928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10479-007-0178-0","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T20:05:32Z","timestamp":1178913932000},"page":"79-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":193,"title":["Models and solution techniques for frequency assignment problems"],"prefix":"10.1007","volume":"153","author":[{"given":"Karen I.","family":"Aardal","sequence":"first","affiliation":[]},{"given":"Stan P. M.","family":"van Hoesel","sequence":"additional","affiliation":[]},{"given":"Arie M. C. A.","family":"Koster","sequence":"additional","affiliation":[]},{"given":"Carlo","family":"Mannino","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,12]]},"reference":[{"key":"178_CR1","unstructured":"Aardal, K. I., Hipolito, A., van Hoesel, C. P. M., & Jansen, B. (1996). A branch-and-cut algorithm for the frequency assignment problem. Research Memorandum 96\/011, Maastricht University."},{"issue":"6","key":"178_CR2","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1287\/opre.50.6.968.353","volume":"50","author":"K. I. Aardal","year":"2002","unstructured":"Aardal, K. I., Hurkens, C. A. J., Lenstra, J. K., & Tiourine, S. R. (2002). Algorithms for radio link frequency assignment: The CALMA project. Operations Research, 50(6), 968\u2013980.","journal-title":"Operations Research"},{"issue":"4","key":"178_CR3","first-page":"261","volume":"1","author":"K. I. Aardal","year":"2003","unstructured":"Aardal, K. I., van Hoesel, C. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2003). Models and solution techniques for the frequency assignment problem. 4OR, 1(4), 261\u2013317.","journal-title":"4OR"},{"issue":"5","key":"178_CR4","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/25.892539","volume":"49","author":"J. Abril","year":"2000","unstructured":"Abril, J., Comellas, F., Cort\u00e9s, A., Oz\u00f3n, J., & Vaquer, M. (2000). A multi-agent system for frequency assignment in cellular radio networks. IEEE Transactions on Vehicular Technology, 49(5), 1558\u20131565.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR5","unstructured":"Adjakpl\u00e9, P. M., & Jaumard, B. (1997). Greedy and tabu search heuristics for channel block assignment in cellular systems. Technical Report G-97-45, \u00c9cole Polytechnique de Montr\u00e9al, July 1997."},{"key":"178_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/(SICI)1099-1131(199809\/10)11:5<327::AID-DAC374>3.0.CO;2-9","volume":"11","author":"F. S. Al-Khaled","year":"1998","unstructured":"Al-Khaled, F. S. (1998). Optimal radio channel assignment through the new binary dynamic simulated annealing algorithm. International Journal of Communication Systems, 11, 327\u2013336.","journal-title":"International Journal of Communication Systems"},{"key":"178_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0012-365X(98)00221-0","volume":"197\u2013198","author":"S. M. Allen","year":"1999","unstructured":"Allen, S. M., Smith, D. H., & Hurley, S. (1999). Lower bounding techniques for frequency assignment. Discrete Mathematics, 197\u2013198, 41\u201352.","journal-title":"Discrete Mathematics"},{"key":"178_CR8","unstructured":"Allen, S. M., Dunkin, N., Hurley, S., & Smith, D. (1998). Frequency assignment problems: Benchmarks and lower bounds. Technical report, University of Glamorgan. URL http:\/\/www.glam.ac.uk\/sotschool\/doms\/Research\/Fap2last.pdf."},{"key":"178_CR9","unstructured":"Alouf, S., Altman, E., Galtier, J., Lalande, J.-F., & Touati, C. (2005). An algorithm for satellite bandwidth allocation. In Proceedings of IEEE infocom 2005 (Vol.\u00a01, pp.\u00a0560\u2013571)."},{"key":"178_CR10","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1109\/TCOM.1973.1091583","volume":"21","author":"L. G. Anderson","year":"1973","unstructured":"Anderson, L. G. (1973). A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications, 21, 1294\u20131301.","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"178_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s101070100247","volume":"91","author":"A. Avenali","year":"2002","unstructured":"Avenali, A., Mannino, C., & Sassano, A. (2002). Minimizing the span of d-walks to compute optimum frequency assignments. Mathematical Programming, 91(2), 357\u2013374. Previously published as technical report 04-00, DIS-Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Rome, Italy.","journal-title":"Mathematical Programming"},{"key":"178_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0377-2217(82)90033-9","volume":"9","author":"I. Baybars","year":"1982","unstructured":"Baybars, I. (1982). Optimal assignment of broadcasting frequencies. European Journal of Operations Research, 9, 257\u2013263.","journal-title":"European Journal of Operations Research"},{"key":"178_CR13","unstructured":"Beckmann, D., & Killat, U. (1999a). Frequency planning with respect to interference minimization in cellular radio networks. Technical Report TD(99)\u2009032 COST\u2009259, Vienna, Austria, January 1999."},{"issue":"4","key":"178_CR14","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/25.775374","volume":"48","author":"D. Beckmann","year":"1999","unstructured":"Beckmann, D., & Killat, U. (1999b). A new strategy for the application of genetic algorithms to the channel-assignment problem. IEEE Transactions on Vehicular Technology, 48(4), 1261\u20131269. July 1999.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0305-0548(03)00210-7","volume":"32","author":"P. Bj\u00f6rklund","year":"2005","unstructured":"Bj\u00f6rklund, P., V\u00e4rbrand, P., & Yuan, D. (2005). Optimal frequency planning in mobile networks with frequency hopping. Computers and Operations Research, 32, 169\u2013186.","journal-title":"Computers and Operations Research"},{"key":"178_CR16","doi-asserted-by":"crossref","unstructured":"Bodlaender, H. L. (1997). Treewidth: Algorithmic techniques and results. Lecture notes in computer science: Vol.\u00a01295, Proceedings 22nd international symposium on mathematical foundations of computer science, MFCS\u201997 (pp.\u00a029\u201336).","DOI":"10.1007\/BFb0029946"},{"key":"178_CR17","unstructured":"Borgne, L. (1994). Automatic frequency assignment for cellular networks using local search heuristics. Master\u2019s thesis, Uppsala University."},{"key":"178_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1018908907763","volume":"76","author":"R. Bornd\u00f6rfer","year":"1998","unstructured":"Bornd\u00f6rfer, R., Eisenbl\u00e4tter, A., Gr\u00f6tschel, M., & Martin, A. (1998a). Frequency assignment in cellular phone networks. Annals of Operations Research, 76, 73\u201393.","journal-title":"Annals of Operations Research"},{"key":"178_CR19","unstructured":"Bornd\u00f6rfer, R., Eisenbl\u00e4tter, A., Gr\u00f6tschel, M., & Martin, A. (1998b). The orientation model for frequency assignment problems. Technical Report TR 98-01, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin."},{"key":"178_CR20","unstructured":"Bouju, A., Boyce, J. F., Dimitropoulos, C. H. D., Vom Scheidt, G., & Taylor, J. G. (1995a). Tabu search for the radio links frequency assignment problem. In Applied decision technologies (ADT\u201995), London."},{"key":"178_CR21","unstructured":"Bouju, A., Boyce, J. F., Dimitropoulos, C. H. D., Vom Scheidt, G., Taylor, J. G., Likas, A., Papageorgiou, G., & Stafylopatis, A. (1995b). Intellegent search for the radio links frequency assignment problem. In International conference for digital signal processing (DSP\u201995), Limassol, Cypres."},{"key":"178_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/T-VT.1978.23724","volume":"27","author":"F. Box","year":"1978","unstructured":"Box, F. (1978). A heuristic technique for assigning frequencies to mobile radio nets. IEEE Transactions on Vehicular Technology, 27, 57\u201374.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251\u2013256.","journal-title":"Communications of the ACM"},{"key":"178_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B. Cabon","year":"1999","unstructured":"Cabon, B., De Givry, S., Lobjois, L., Schiex, T., & Warners, J. P. (1999). Benchmarks problems: Radio link frequency assignment. Constraints, 4, 79\u201389.","journal-title":"Constraints"},{"key":"178_CR25","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1504\/IJMNDI.2006.010811","volume":"1","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T. (Ed.). (2006). International Journal of Mobile Network Design and Innovation, 1, 2.","journal-title":"International Journal of Mobile Network Design and Innovation"},{"key":"178_CR26","unstructured":"CALMA website. (1995). EUCLID CALMA project. Publications and instances available at FTP Site: ftp:\/\/ftp.win.tue.nl\/pub\/techreports\/CALMA\/."},{"issue":"4","key":"178_CR27","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1109\/25.775373","volume":"48","author":"A. Capone","year":"1999","unstructured":"Capone, A., & Trubian, M. (1999). Channel assignment problem in cellular systems: a new model and a tabu search algorithm. IEEE Transactions on Vehicular Technology, 48(4), 1252\u20131260.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR28","unstructured":"Carlsson, M., & Grindal, M. (1993). Automatic frequency assignment for cellular telephones using constraint satisfaction techniques, In Proceedings of the tenth international conference on logic programming (pp.\u00a0648\u2013665)."},{"key":"178_CR29","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02125459","volume":"63","author":"D. J. Castelino","year":"1996","unstructured":"Castelino, D. J., Hurley, S., & Stephens, N. M. (1996). A tabu search algorithm for frequency assignment. Annals of Operations Research, 63, 301\u2013319.","journal-title":"Annals of Operations Research"},{"issue":"9","key":"178_CR30","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/S0305-0548(96)00098-6","volume":"24","author":"K.-N. Chang","year":"1997","unstructured":"Chang, K.-N., & Kim, S. (1997). Channel allocation in cellular radio networks. Computers and Operations Research, 24(9), 849\u2013860.","journal-title":"Computers and Operations Research"},{"key":"178_CR31","volume-title":"Graph theory: An algorithmic approach","author":"N. Christofides","year":"1975","unstructured":"Christofides, N. (1975). Graph theory: An algorithmic approach. London: Academic."},{"issue":"2","key":"178_CR32","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1504\/IJMNDI.2006.010812","volume":"1","author":"G. Colombo","year":"2006","unstructured":"Colombo, G. (2006). A genetic algorithm for frequency assignment with problem decomposition. International Journal of Mobile Network Design and Innovation, 1(2), 102\u2013112.","journal-title":"International Journal of Mobile Network Design and Innovation"},{"key":"178_CR33","unstructured":"Cooper, M. C., de Givry, S., & Schiex, T. (2007). Optimal soft arc consistency, In Proceedings of international joint conference on artificial intelligence (IJCAI\u20192007), Hyderabad, India."},{"key":"178_CR34","volume-title":"Wireless flexible personalized communications\u2014COST 259: European co-operation in mobile radio research","author":"L. M. Correia","year":"2001","unstructured":"Correia, L. M. (Ed.). (2001). Wireless flexible personalized communications\u2014COST 259: European co-operation in mobile radio research. New York: Wiley. COST Action 259\u2014Final Report."},{"key":"178_CR35","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02023000","volume":"41","author":"D. Costa","year":"1993","unstructured":"Costa, D. (1993). On the use of some known methods for t-colourings of graphs. Annals of Operations Research, 41, 343\u2013358.","journal-title":"Annals of Operations Research"},{"key":"178_CR36","first-page":"191","volume":"35","author":"M. B. Cozzens","year":"1982","unstructured":"Cozzens, M. B., & Roberts, F. S. (1982). T-colorings of graphs and the channel assignment problem. Congressus Numerantium, 35, 191\u2013208.","journal-title":"Congressus Numerantium"},{"key":"178_CR37","doi-asserted-by":"crossref","unstructured":"Crisan, C., & M\u00fchlenbein, H. (1998). The breeder genetic algorithm for frequency assignment. In Lecture notes in computer science (Vol.\u00a01498, pp.\u00a0897\u2013906).","DOI":"10.1007\/BFb0056931"},{"key":"178_CR38","doi-asserted-by":"crossref","unstructured":"Crompton, W., Hurley, S., & Stephens, N. M. (1994). A parallel genetic algorithm for frequency assignment problems. In Proceedings IMACS\/IEEE international symposium on signal processing, robotics and neural networks (pp.\u00a081\u201384). Lille, France, April 1994.","DOI":"10.1117\/12.179242"},{"key":"178_CR39","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/ett.4460050219","volume":"5","author":"M. Cuppini","year":"1994","unstructured":"Cuppini, M. (1994). A genetic algorithm for channel assignment problems. European Transactions on Telecommunications and Related Technologies, 5, 285\u2013294.","journal-title":"European Transactions on Telecommunications and Related Technologies"},{"key":"178_CR40","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/25.481817","volume":"45","author":"E. Del Re","year":"1996","unstructured":"Del Re, E., Fantacci, R., & Ronga, L. (1996). A synamic channel allocation technique based on Hopfield neural networks. IEEE Transactions on Vehicular Technology, 45, 26\u201332.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR41","doi-asserted-by":"crossref","unstructured":"Dorne, R., & Hao, J.-K. (1995). An evolutionary approach for frequency assignment in cellular radio networks. In IEEE international conference on evolutionary computing, Perth, Australia.","DOI":"10.1109\/ICEC.1995.487441"},{"key":"178_CR42","doi-asserted-by":"crossref","unstructured":"Dorne, R., & Hao, J.-K. (1996). Constraint handling in evolutionary search: A case study of the frequency assignment. In Lecture notes in computer science (Vol.\u00a01141, pp.\u00a0801\u2013810).","DOI":"10.1007\/3-540-61723-X_1043"},{"key":"178_CR43","doi-asserted-by":"crossref","unstructured":"Dorne, R., & Hao, J.-K. (1998). A new genetic local search algorithm for graph coloring. In Lecture notes in computer science (Vol.\u00a01498, pp.\u00a0745\u2013754).","DOI":"10.1007\/BFb0056916"},{"key":"178_CR44","unstructured":"Dunkin, N., & Allen, S. M. (1997). Frequency assignment problems: Representations and solutions. Technical Report CSD-TR-97-14 Royal Holloway, University of London."},{"key":"178_CR45","unstructured":"Dunkin, N., Bater, J., Jeavons, P., & Cohen, D. (1998). Towards high order constraint representations for the frequency assignment problem. Technical Report CSD-TR-98-05, Royal Holloway University of London."},{"key":"178_CR46","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/B:ANOR.0000032575.38969.ab","volume":"130","author":"A. Dupont","year":"2004","unstructured":"Dupont, A., Alvernhe, E., & Vasquez, M. (2004). Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation. Annals of Operations Research, 130, 179\u2013198.","journal-title":"Annals of Operations Research"},{"key":"178_CR47","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/25.192382","volume":"42","author":"M. Duque-Ant\u00f3n","year":"1993","unstructured":"Duque-Ant\u00f3n, M., Kunz, D., & R\u00fcber, B. (1993). Channel assignment for cellular radio using simulated annealing. IEEE Transactions on Vehicular Technology, 42, 14\u201321.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR48","unstructured":"Eisenbl\u00e4tter, A. (2001). Frequency assignment in GSM networks: Models, heuristics, and lower bounds. PhD thesis, Technische Universit\u00e4t Berlin, Berlin, Germany, 2001."},{"key":"178_CR49","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-47867-1_20","volume-title":"Proceedings of the 9th conference on integer programming and combinatorial optimization (IPCO\u201902)","author":"A. Eisenbl\u00e4tter","year":"2002","unstructured":"Eisenbl\u00e4tter, A. (2002). The semidefinite relaxation of the k-partition polytope is strong. In W. J. Cook & A. S. Schulz (Eds.), Lecture notes in computer science: Vol.\u00a02337. Proceedings of the 9th conference on integer programming and combinatorial optimization (IPCO\u201902) (pp.\u00a0273\u2013290). Berlin: Springer."},{"key":"178_CR50","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1158","volume":"22","author":"A. Eisenbl\u00e4tter","year":"2002","unstructured":"Eisenbl\u00e4tter, A., Gr\u00f6tschel, M., & Koster, A. M. C. A. (2002). Frequency assignment and ramifications of coloring. Discussiones Mathematicae Graph Theory, 22, 51\u201388.","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"178_CR51","doi-asserted-by":"crossref","unstructured":"Eisenbl\u00e4tter, A., Geerdes, H.-F., & Siomina, I. (2006). Integrated access point placement and channel assignment for wireless LANs in an indoor office environment. Technical Report 346 Matheon Berlin, Germany. URL http:\/\/www.matheon.de. To appear in Proceedings of IEEE WoWMoM, Helsinki, Finland, 2007.","DOI":"10.1109\/WOWMOM.2007.4351711"},{"key":"178_CR52","first-page":"125","volume":"26","author":"P. Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A. L., & Taylor, H. (1979). Choosability in graphs. Congressus Numerantium, 26, 125\u2013157.","journal-title":"Congressus Numerantium"},{"key":"178_CR53","unstructured":"FAP (2006). Frequency assignment problems, December 2006. URL http:\/\/www.fap.ema.fr\/."},{"key":"178_CR54","unstructured":"FAP web (2000\u20132007). A website devoted to frequency assignment. URL http:\/\/fap.zib.de. Maintained by A.\u00a0Eisenbl\u00e4tter & A. M. C. A. Koster."},{"key":"178_CR55","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(99)00254-4","volume":"123","author":"M. Fischetti","year":"2000","unstructured":"Fischetti, M., Lepschy, C., Minerva, G., Romanin-Jacur, G., & Toto, E. (2000). Frequency assignment in mobile radio systems using branch-and-cut techniques. European Journal of Operational Research, 123, 241\u2013255. Previously published as technical report of the Universita di Padova.","journal-title":"European Journal of Operational Research"},{"key":"178_CR56","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1109\/25.182594","volume":"41","author":"N. Funabiki","year":"1992","unstructured":"Funabiki, N., & Takefuji, Y. (1992). A neural network parallel algorithm for channel assignment problems in cellular radio networks. IEEE Transactions on Vehicular Technology, 41, 430\u2013437.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR57","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/B:JMMA.0000026709.24659.da","volume":"3","author":"P. Galinier","year":"2004","unstructured":"Galinier, P., & Hao, J.-K. (2004). A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3, 73\u201388.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"178_CR58","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10288-004-0056-4","volume":"3","author":"P. Galinier","year":"2005","unstructured":"Galinier, P., Gendreau, M., Soriano, P., & Bisaillon, S. (2005). Solving the frequency assignment problem with polarization by local search and tabu. 4OR: A Quarterly Journal of Operations Research, 3, 59\u201378.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"178_CR59","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A. Gamst","year":"1986","unstructured":"Gamst, A. (1986). Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35, 8\u201314.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR60","doi-asserted-by":"crossref","unstructured":"Gamst, A. (1991). Application of graph theoretical methods to GSM radio network planning. In Proceedings of IEEE international symposium on circuits and systems (Vol.\u00a02, pp.\u00a0942\u2013945).","DOI":"10.1109\/ISCAS.1991.176519"},{"key":"178_CR61","volume-title":"Proceedings of GLOBECOM\u201982","author":"A. Gamst","year":"1982","unstructured":"Gamst, A., & Rave, W. (1982). On frequency assignment in mobile automatic telephone systems. In Proceedings of GLOBECOM\u201982. New York: IEEE."},{"key":"178_CR62","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1049\/ip-com:19971249","volume":"144","author":"A. I. Giortzis","year":"1997","unstructured":"Giortzis, A. I., & Turner, L. F. (1997). Application of mathematical programming to the fixed channel assignment problem in mobile radio networks. IEE Proceedings\u2014Communications, 144, 257\u2013264.","journal-title":"IEE Proceedings\u2014Communications"},{"key":"178_CR63","doi-asserted-by":"crossref","unstructured":"Graham, J. S., Montemanni, R., Moon, J. N. J., & Smith, D. H. (2007, to appear). Frequency assignment, multiple interference and binary constraints, ACM Wireless Networks.","DOI":"10.1007\/s11276-006-0730-x"},{"key":"178_CR64","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W. K. Hale","year":"1980","unstructured":"Hale, W. K. (1980). Frequency assignment: Theory and applications. Proceedings of the IEEE, 68, 1497\u20131514.","journal-title":"Proceedings of the IEEE"},{"key":"178_CR65","doi-asserted-by":"crossref","unstructured":"Hao, J.-K., & Dorne, R. (1996). Study of genetic search for the frequency assignment problem. In Lecture notes in computer science (Vol.\u00a01063, pp.\u00a0333\u2013344).","DOI":"10.1007\/3-540-61108-8_48"},{"key":"178_CR66","unstructured":"Hao, J.-K., & Perrier, L. (1999). Tabu search for the frequency assignment problem in cellular radio networks. Technical Report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France."},{"key":"178_CR67","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009690321348","volume":"4","author":"J.-K. Hao","year":"1998","unstructured":"Hao, J.-K., Dorne, R., & Galinier, P. (1998). Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics, 4, 47\u201362.","journal-title":"Journal of Heuristics"},{"key":"178_CR68","unstructured":"Hellebrandt, M., & Heller, H. (2000). A new heuristic method for frequency assignment. Technical Report TD(00)\u2009003 COST\u2009259 Valencia, Spain, January 2000."},{"key":"178_CR69","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10288-004-0057-3","volume":"3","author":"A. Hertz","year":"2005","unstructured":"Hertz, A., Schindl, D., & Zufferey, N. (2005). Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR: A Quarterly Journal of Operations Research, 3, 139\u2013161.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"5","key":"178_CR70","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/25.994802","volume":"12","author":"S. Hurley","year":"2002","unstructured":"Hurley, S. (2002). Planning effective cellular mobile radio networks. IEEE Transactions on Vehicular Technology, 12(5), 243\u2013253.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR71","volume-title":"Methods and algorithms for radio channel assignment","author":"S. Hurley","year":"2002","unstructured":"Hurley, S., & Smith, D. H. (2002). Meta-heuristics and channel assignment. In R. Leese & S. Hurley (Eds.), Methods and algorithms for radio channel assignment. Oxford: Oxford University Press, Chap.\u00a03."},{"key":"178_CR72","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1029\/97RS01866","volume":"32","author":"S. Hurley","year":"1997","unstructured":"Hurley, S., Smith, D. H., & Thiel, S. U. (1997). FASoft: A system for discrete channel frequency assignment. Radio Science, 32, 1921\u20131939.","journal-title":"Radio Science"},{"key":"178_CR73","doi-asserted-by":"crossref","unstructured":"Jaimes-Romero, F. J., Munoz-Rodriguez, D., & Tekinay, S. (1996). Channel assignment in cellular systems using genetic algorithms. In Proceedings of the 46th IEEE vehicular technology conference (pp.\u00a0741\u2013745), Atlanta, USA.","DOI":"10.1109\/VETEC.1996.501410"},{"issue":"3","key":"178_CR74","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1109\/25.765037","volume":"48","author":"J. Janssen","year":"1999","unstructured":"Janssen, J., & Kilakos, K. (1999). An optimal solution to the \u201cPhiladelphia\u201d channel assignment problem. IEEE Transactions on Vehicular Technology, 48(3), 1012\u20131014. Previously published as report CDAM-96-16 London School of Economics.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR75","unstructured":"Janssen, J., & Wentzell, T. (2000). Lower bounds from tile covers for the channel assignment problem. Technical Report G-2000-09 GERAD, HEC, Montreal, Canada."},{"key":"178_CR76","unstructured":"Jaumard, B., Marcotte, O., & Meyer, C. (1998). Estimation of the quality of cellular networks using column generation techniques. Technical Report G-98-02 Ecole Polytechnique de Montr\u00e9al, January 1998."},{"key":"178_CR77","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-1-4615-5087-7_13","volume-title":"Telecommunications network planning","author":"B. Jaumard","year":"1999","unstructured":"Jaumard, B., Marcotte, O., & Meyer, C. (1999). Mathematical models and exact methods for channel assignment in cellular networks. In B. Sans\u00e1o & P. Soriano (Eds.), Telecommunications network planning (pp.\u00a0239\u2013255). Boston: Kluwer Academic, Chap.\u00a013."},{"key":"178_CR78","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(02)00176-2","volume":"118","author":"B. Jaumard","year":"2002","unstructured":"Jaumard, B., Marcotte, O., Meyer, C., & Vovor, T. (2002). Comparison of column generation models for channel assignment in cellular networks. Discrete Applied Mathematics, 118, 299\u2013322. Previously published as technical report of Ecole Polytechnique de Montr\u00e9al, November 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"178_CR79","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.06.017","volume":"160","author":"J. Kalvenes","year":"2005","unstructured":"Kalvenes, J., Kennington, J., & Olinick, E. (2005). Hierarchical cellular network design with channel allocation. European Journal of Operational Research, 160, 3\u201318.","journal-title":"European Journal of Operational Research"},{"key":"178_CR80","doi-asserted-by":"crossref","unstructured":"Kapsalis, A., Chardaire, P., Rayward-Smith, V. J., & Smith, G. D. (1995). The radio link frequency assignment problem: A case study using genetic algorithms. In Lecture notes on computer science (Vol.\u00a0993, pp.\u00a0117\u2013131).","DOI":"10.1007\/3-540-60469-3_30"},{"key":"178_CR81","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N. Karmarkar","year":"1991","unstructured":"Karmarkar, N., Resende, M. G. C., & Ramakrishnan, K. G. (1991). An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming, 52, 597\u2013618.","journal-title":"Mathematical Programming"},{"issue":"3","key":"178_CR82","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/98.511762","volume":"3","author":"I. Katzela","year":"1996","unstructured":"Katzela, I., & Naghshineh, M. (1996). Channel assignment schemes for cellular mobile telecommunication systems. Personal Communications Magazine, 3(3), 10\u201331.","journal-title":"Personal Communications Magazine"},{"key":"178_CR83","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/dac.4500080304","volume":"8","author":"M. G. Kazantzakis","year":"1995","unstructured":"Kazantzakis, M. G., Demestichas, P. P., & Anagnostou, M. E. (1995). Optimum frequency reuse in mobile telephone systems. International Journal of Communications Systems, 8, 185\u2013190.","journal-title":"International Journal of Communications Systems"},{"issue":"4","key":"178_CR84","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/25.653070","volume":"46","author":"J.-S. Kim","year":"1996","unstructured":"Kim, J.-S., Park, S., Dowd, P., & Nasrabadi, N. (1996). Cellular radio channel assignment using a modified Hopfield network. IEEE Transactions on Vehicular Technology, 46(4), 957\u2013967.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR85","first-page":"233","volume":"396","author":"A. Kn\u00e4lmann","year":"1994","unstructured":"Kn\u00e4lmann, A., & Quellmalz, A. (1994). Solving the frequency assignment problem with simulated annealing. IEE Conference Publication, 396, 233\u2013240.","journal-title":"IEE Conference Publication"},{"issue":"1","key":"178_CR86","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1111\/j.1467-9574.2007.00357.x","volume":"61","author":"A. W. J. Kolen","year":"2007","unstructured":"Kolen, A. W. J. (2007). A genetic algorithm for frequency assignment. Statistica Neerlandica, 61(1), 4\u201315.","journal-title":"Statistica Neerlandica"},{"key":"178_CR87","unstructured":"Kolen, A. W. J., van Hoesel, C. P. M., & van der Wal, R. (1994). A constraint satisfaction approach to the radio link frequency assignment problem. Technical Report 2.2.2 EUCLID CALMA project."},{"key":"178_CR88","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.disc.2003.05.008","volume":"275","author":"A. E. Koller","year":"2004","unstructured":"Koller, A. E., & Noble, S. D. (2004). Domination analysis of greedy heuristics for the frequency assignment problem. Discrete Mathematics, 275, 331\u2013338.","journal-title":"Discrete Mathematics"},{"key":"178_CR89","unstructured":"Koster, A. M. C. A. (1999). Frequency assignment\u2014models and algorithms. PhD thesis, Maastricht University."},{"issue":"3\u20135","key":"178_CR90","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0167-6377(98)00043-1","volume":"23","author":"A. M. C. A. Koster","year":"1998","unstructured":"Koster, A. M. C. A., van Hoesel, C. P. M., & Kolen, A. W. J. (1998). The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters, 23(3\u20135), 89\u201397.","journal-title":"Operations Research Letters"},{"issue":"94\u201395","key":"178_CR91","first-page":"101","volume":"30","author":"A. M. C. A. Koster","year":"2001","unstructured":"Koster, A. M. C. A., van Hoesel, C. P. M., & Kolen, A. W. J. (2001). Lower bounds for minimum interference frequency assignment problems. Ricerca Operativa, 30(94\u201395), 101\u2013116.","journal-title":"Ricerca Operativa"},{"issue":"3","key":"178_CR92","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.10046","volume":"40","author":"A. M. C. A. Koster","year":"2002","unstructured":"Koster, A. M. C. A., van Hoesel, C. P. M., & Kolen, A. W. J. (2002). Solving partial constraint satisfaction problems with tree decomposition. Networks, 40(3), 170\u2013180.","journal-title":"Networks"},{"key":"178_CR93","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.dam.2004.01.020","volume":"145","author":"D. Kr\u00e1l","year":"2005","unstructured":"Kr\u00e1l, D. (2005). An exact algorithm for the channel assignment problem. Discrete Applied Mathematics, 145, 326\u2013331.","journal-title":"Discrete Applied Mathematics"},{"key":"178_CR94","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/25.69987","volume":"40","author":"D. Kunz","year":"1991","unstructured":"Kunz, D. (1991). Channel assignment for cellular radio using neural networks. IEEE Transactions on Vehicular Technology, 40, 188\u2013193.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR95","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/25.481825","volume":"45","author":"W. K. Lai","year":"1996","unstructured":"Lai, W. K., & Coghill, G. G. (1996). Channel assignment through evolutionary optimization. IEEE Transactions on Vehicular Technology, 45, 91\u201395.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR96","unstructured":"Lee, Y., Kim, K., & Choi, Y. (2002). Optimization of AP placement and channel assignment in wireless LANs. In Proceedings of LCN\u201902, Tampa, FL."},{"key":"178_CR97","series-title":"Oxford lecture series in mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198503149.001.0001","volume-title":"Methods and algorithms for radio channel assignment","author":"R. Leese","year":"2002","unstructured":"Leese, R., & Hurley, S. (Eds.) (2002). Methods and algorithms for radio channel assignment. Oxford lecture series in mathematics and its applications. Oxford: Oxford University Press."},{"key":"178_CR98","doi-asserted-by":"crossref","unstructured":"Leung, K. K., & Kim, B.-J. (2003). Frequency assignment for IEEE 802.11 wireless networks. In Proceedings of VTC 2003-Fall, Orlando, FL.","DOI":"10.1109\/VETECF.2003.1285259"},{"key":"178_CR99","unstructured":"Ling, X., & Yeung, K. L. (2005). Joint access point placement and channel assignment for 802.11 wireless LANs. In Proceedings of WCNC 2005, New Orleans, LA."},{"key":"178_CR100","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V. Maniezzo","year":"2000","unstructured":"Maniezzo, V., & Carbonaro, A. (2000). An ants heuristic for the frequency assignment problem. Future Generation Computer Systems, 16, 927\u2013935.","journal-title":"Future Generation Computer Systems"},{"key":"178_CR101","unstructured":"Maniezzo, V., & Montemanni, R. (2000). An exact algorithm for the min-interference frequency assignment problem. Technical Report WP-CO0003 Scienze dell\u2019Informazione, University of Bologna, Cesena, Italy."},{"issue":"1","key":"178_CR102","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(02)00239-1","volume":"129","author":"C. Mannino","year":"2003","unstructured":"Mannino, C., & Sassano, A. (2003). An enumerative algorithm for the frequency assignment problem. Discrete Applied Mathematics, 129(1), 155\u2013169.","journal-title":"Discrete Applied Mathematics"},{"key":"178_CR103","unstructured":"Mannino, C., Oriolo, G., & Sassano, A. (2000). Weighted stable set problem in k-thin graphs. Technical Report 09\u201300 Universit\u00e1 di Roma \u201cLa Sapienza\u201d."},{"key":"178_CR104","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/25.260746","volume":"42","author":"R. Mathar","year":"1993","unstructured":"Mathar, R., & Mattfeldt, J. (1993). Channel assignment in cellular radio networks. IEEE Transactions on Vehicular Technology, 42, 647\u2013656.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR105","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1014959317542","volume":"107","author":"R. Mathar","year":"2001","unstructured":"Mathar, R., & Schmeink, M. (2001). Optimal base station positioning and channel assignment for 3G mobile networks by integer programming. Annals of Operations Research, 107, 225\u2013236.","journal-title":"Annals of Operations Research"},{"key":"178_CR106","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., & Trick, M. A. (1996). A column generation approach for graph coloring. INFORMS Journal on Computing, 8, 344\u2013354.","journal-title":"INFORMS Journal on Computing"},{"key":"178_CR107","unstructured":"Metzger, B. H. (1970). Spectrum management technique. Presentation at 38th National ORSA meeting, Detroit, MI."},{"issue":"3","key":"178_CR108","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1094549.1094554","volume":"9","author":"A. Mishra","year":"2005","unstructured":"Mishra, A., Banerjee, S., & Arbaugh, W. (2005). Weighted coloring based channel assignment for wlans. ACM SIGMOBILE Mobile Computing and Communications Review, 9(3), 19\u201331.","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"1\u20134","key":"178_CR109","first-page":"237","volume":"107","author":"R. Montemanni","year":"2002","unstructured":"Montemanni, R., Smith, D. H., & Allen, S. M. (2002a). Lower bounds for fixed spectrum frequency assignment. Annals of Operations Research, 107(1\u20134), 237\u2013250.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"178_CR110","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/TVT.2002.800634","volume":"15","author":"R. Montemanni","year":"2002","unstructured":"Montemanni, R., Smith, D. H., & Allen, S. M. (2002b). An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. IEEE Transactions on Vehicular Technology, 15(5), 949\u2013953.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"4","key":"178_CR111","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1109\/TVT.2003.810976","volume":"52","author":"R. Montemanni","year":"2003","unstructured":"Montemanni, R., Moon, J. N. J., & Smith, D. H. (2003). An improved tabu search algorithm for the fixed spectrum frequency assignment problem. IEEE Transactions on Vehicular Technology, 52(4), 891\u2013901.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR112","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/S0377-2217(03)00127-9","volume":"156","author":"R. Montemanni","year":"2004","unstructured":"Montemanni, R., Smith, D. H., & Allen, S. M. (2004). An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. European Journal of Operational Research, 156, 736\u2013751.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"178_CR113","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TVT.2005.844659","volume":"54","author":"J. N. J. Moon","year":"2005","unstructured":"Moon, J. N. J., Hughes, L. A., & Smith, D. H. (2005). Assignment of frequency lists in frequency hopping networks. IEEE Transactions on Vehicular Technology, 54(3), 1147\u20131159.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR114","volume-title":"Handbook of combinatorial optimization","author":"R. A. Murphey","year":"1999","unstructured":"Murphey, R. A., Pardalos, P. M., & Resende, M. G. C. (1999). Frequency assignment problems. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization, Supplement Volume A. Dordrecht: Kluwer Academic."},{"key":"178_CR115","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G. L. Nemhauser","year":"1988","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: Wiley."},{"key":"178_CR116","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/25.661043","volume":"47","author":"C. Y. Ngo","year":"1998","unstructured":"Ngo, C. Y., & Li, V. O. K. (1998). Fixed channel assignment in cellular radio networks using a modified genetic algorithm. IEEE Transactions on Vehicular Technology, 47, 163\u2013171.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR117","volume-title":"Performance enhancements in a frequency hopping GSM network","author":"T. Nielsen","year":"2000","unstructured":"Nielsen, T., & Wigard, J. (2000). Performance enhancements in a frequency hopping GSM network. Dordrecht: Kluwer Academic. ISBN: 0 7923 7819 9."},{"key":"178_CR118","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg, M. (1989). The boolean quadric polytope: Some characteristics, facets and relatives. Mathematical Programming, 45, 139\u2013172.","journal-title":"Mathematical Programming"},{"key":"178_CR119","unstructured":"Palpant, M., Artigues, C., & Michelon, P. (2002). A heuristic for solving the frequency assignment problem. In XI Latin\u2013Iberian\u2013American congress of operations research (CLAIO 2002)."},{"key":"178_CR120","volume-title":"Combinatorial optimization: Algorithms and complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity. New Jersey: Prentice-Hall."},{"key":"178_CR121","doi-asserted-by":"crossref","first-page":"258","DOI":"10.15807\/jorsj.39.258","volume":"39","author":"T. Park","year":"1996","unstructured":"Park, T., & Lee, C. Y. (1996). Application of the graph coloring algorithm to the frequency assignment problem. Journal of the Operations Research Society of Japan, 39, 258\u2013265.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"178_CR122","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(89)90214-8","volume":"74","author":"A. Petford","year":"1989","unstructured":"Petford, A., & Welsh, D. (1989). A randomised 3-colouring algorithm. Discrete Mathematics, 74, 253\u2013261.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"178_CR123","first-page":"301","volume":"407","author":"A. Quellmalz","year":"1995","unstructured":"Quellmalz, A., Kn\u00e4lmann, A., & M\u00fcller, B. (1995). Efficient frequency assignment with simulated annealing. IEE Conference Publication, 407(2), 301\u2013304.","journal-title":"IEE Conference Publication"},{"issue":"4","key":"178_CR124","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0895480189171746","volume":"7","author":"A. Raychaudhuri","year":"1994","unstructured":"Raychaudhuri, A. (1994). Further results on t-coloring and frequency assignment problems. SIAM Journal on Discrete Mathematics, 7(4), 605\u2013613.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"178_CR125","doi-asserted-by":"crossref","unstructured":"Riihij\u00e4rvi, J., Petrova, M., & M\u00e4h\u00f6nen, P. (2005). Frequency allocation for WLANs using graph colouring techniques. In Proceedings of WONS\u201905, St. Moritz, Switzerland.","DOI":"10.1109\/WONS.2005.19"},{"key":"178_CR126","unstructured":"ROADEF website. (2001). ROADEF Challenge. URL http:\/\/www.prism.uvsq.fr\/~vdc\/ROADEF\/CHALLENGES\/2001\/challenge(2001)html."},{"key":"178_CR127","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"F. S. Roberts","year":"1991","unstructured":"Roberts, F. S. (1991). t-colorings of graphs: Recent results and open problems. Discrete Mathematics, 93, 229\u2013245.","journal-title":"Discrete Mathematics"},{"key":"178_CR128","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/dac.4500080603","volume":"8","author":"A. N. Rouskas","year":"1995","unstructured":"Rouskas, A. N., Kazantzakis, M. G., & Anagnostou, M. E. (1995). Optimal channel assignment in cellular networks. International Journal of Communication Systems, 8, 359\u2013364.","journal-title":"International Journal of Communication Systems"},{"key":"178_CR129","first-page":"689","volume-title":"DIMACS series in discrete mathematics and theoretical computer science","author":"C. K. Rushforth","year":"1997","unstructured":"Rushforth, C. K., & Wang, W. (1997). Local search for channel assignment in cellular mobile networks. In DIMACS series in discrete mathematics and theoretical computer science (Vol.\u00a035, pp.\u00a0689\u2013709). Providence: American Mathematical Society."},{"key":"178_CR130","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/72.737504","volume":"10","author":"H. G. Sandalidis","year":"1999","unstructured":"Sandalidis, H. G., Stavroulakis, P. P., & Rodriguez-Tellez, J. (1999). Borrowing channel assignment strategies based on heuristic techniques for cellular systems. IEEE Transactions on Neural Networks, 10, 176\u2013181.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"178_CR131","unstructured":"Schiex, T., de Givry, S., & Sanchez, M. (2006). Toulbar2\u2014an open source weighted constraint satisfaction solver. URL http:\/\/mulcyber.toulouse.inra.fr\/projects\/toulbar2\/."},{"key":"178_CR132","doi-asserted-by":"crossref","unstructured":"Sivarajan, K. N., McEliece, R. J., & Ketchum, J. W. (1989). Channel assignment in cellular radio. In Proceedings of the 39th IEEE vehicular technology conference (pp.\u00a0846\u2013850).","DOI":"10.1109\/VETEC.1989.40173"},{"key":"178_CR133","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0377-2217(98)80006-4","volume":"107","author":"D. H. Smith","year":"1998","unstructured":"Smith, D. H., Hurley, S., & Thiel, S. U. (1998). Improving heuristics for the frequency assignment problem. European Journal of Operational Research, 107, 76\u201386.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"178_CR134","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/15.925542","volume":"43","author":"D. H. Smith","year":"2001","unstructured":"Smith, D. H., Taplin, R. K., & Hurley, S. (2001). Frequency assignment with complex co-site constraints. IEEE Transaction on Electromagnetic Compatibility, 43(2), 210\u2013218.","journal-title":"IEEE Transaction on Electromagnetic Compatibility"},{"issue":"1\u20134","key":"178_CR135","first-page":"285","volume":"107","author":"D. H. Smith","year":"2002","unstructured":"Smith, D. H., Allen, S. M., & Hurley, S. (2002). Characteristics of good meta-heuristic algorithms for the frequency assignment problem. Annals of Operations Research, 107(1\u20134), 285\u2013301.","journal-title":"Annals of Operations Research"},{"key":"178_CR136","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TVT.2006.883770","volume":"56","author":"D. H. Smith","year":"2007","unstructured":"Smith, D. H., Hughes, L. A., Moon, J. N. J., & Montemanni, R. (2007). Measuring the effectiveness of frequency assignment algorithms. IEEE Transactions on Vehicular Technology, 56, 331\u2013341.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR137","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/49.552073","volume":"15","author":"K. A. Smith","year":"1997","unstructured":"Smith, K. A., & Palaniswami, M. (1997). Static and dynamic channel assignment using neural networks. IEEE Journal on Selected Areas in Communications, 15, 238\u2013249.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"178_CR138","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/25.618193","volume":"46","author":"C. W. Sung","year":"1997","unstructured":"Sung, C. W., & Wong, W. S. (1997). Sequential packing algorithm for channel assignment under cochannel and adjacent channel interference constraint. IEEE Transactions on Vehicular Technology, 46, 676\u2013685.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR139","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/90.554720","volume":"5","author":"D. Tcha","year":"1997","unstructured":"Tcha, D., Chung, Y., & Choi, T. (1997). A new lower bound for the frequency assignment problem. IEEE\/ACM Transactions on Networking, 5, 34\u201339.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"178_CR140","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0377-2217(81)90325-8","volume":"6","author":"H. Thuve","year":"1981","unstructured":"Thuve, H. (1981). Frequency planning as a set partitioning problem. European Journal of Operational Research, 6, 29\u201337.","journal-title":"European Journal of Operational Research"},{"key":"178_CR141","unstructured":"Tiourine, S. R., Hurkens, C. A. J., & Lenstra, J. K. (1995). An overview of algorithmic approaches to frequency assignment problems. In Calma symposium on combinatorial algorithms for military applications (pp.\u00a053\u201362)."},{"key":"178_CR142","unstructured":"Tsang, E., & Voudouris, C. (1998). Solving the radio link frequency assignment problem using guided local search. In NATO symposium on radio length frequency assignment, Aalborg, Denmark, 1998. http:\/\/cswww.essex.ac.uk\/CSP\/papers.html."},{"key":"178_CR143","doi-asserted-by":"crossref","unstructured":"Valenzuela, C., Hurley, S., & Smith, D. H. (1998). A permutation based genetic algorithm for minimum span frequency assignment. In Lecture notes in computer science (Vol.\u00a01498, pp.\u00a0907\u2013916).","DOI":"10.1007\/BFb0056932"},{"key":"178_CR144","unstructured":"van Benthem, H. P. (1995). GRAPH generating radio link frequency assignment problems heuristically. Master\u2019s thesis, Delft University of Technology."},{"key":"178_CR145","unstructured":"Verfaillie, G., Lema\u00eetre, M., & Schiex, T. (1996). Russian doll search for solving constraint optimization problems. In Proceedings of the 13th international conference on artificial intelligence (AAAI-96) (pp.\u00a0181\u2013187), Portland, OR, USA."},{"key":"178_CR146","unstructured":"Villegas, E. G., Ferr\u00e9, R. V., & Aspas, J. P. (2005). Implementation of a distributed dynamic channel assignment mechanism for IEEE 802.11 networks. In Proceedings of PIMRC 2005, September 2005."},{"key":"178_CR147","first-page":"9","volume":"5","author":"V. G. Vizing","year":"1965","unstructured":"Vizing, V. G. (1965). Critical graphs with given chromatic class. Diskretniyi Analiz, 5, 9\u201317 (in Russian).","journal-title":"Diskretniyi Analiz"},{"key":"178_CR148","unstructured":"Walser, J. P. (1996). Feasible cellular frequency assignment using constraint programming abstractions. In Proceedings of the workshop on constraint programming applications (CP96), Cambridge, MA, USA."},{"key":"178_CR149","doi-asserted-by":"crossref","unstructured":"Wang, L., & Gu, W. (2004). Genetic algorithms with stochastic ranking for optimal channel assignment in mobile communications. In Lecture notes in computer science (Vol.\u00a03314, pp.\u00a0154\u2013159).","DOI":"10.1007\/978-3-540-30497-5_25"},{"key":"178_CR150","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/25.533761","volume":"45","author":"W. Wang","year":"1996","unstructured":"Wang, W., & Rushforth, C. K. (1996). An adaptive local-search algorithm for the channel-assignment problem (CAP). IEEE Transactions on Vehicular Technology, 45, 459\u2013466.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR151","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(96)00139-4","volume":"78","author":"J. P. Warners","year":"1997","unstructured":"Warners, J. P., Terlaky, T., Roos, C., & Jansen, B. (1997). A potential reduction approach to the frequency assignment problem. Discrete Applied Mathematics, 78, 251\u2013282.","journal-title":"Discrete Applied Mathematics"},{"key":"178_CR152","unstructured":"Yuan, D., Bj\u00f6rklund, P., & V\u00e4rbrand, P. (2002). Optimal frequency planning in mobile networks with frequency hopping. Technical Report LiTH-ITN-R-2002\u20133 Link\u00f6ping University, Norrk\u00f6ping, Sweden submitted to Computers and Operations Research."},{"key":"178_CR153","unstructured":"Zerovnik, J. (1997). Experiments with a randomized algorithm for a frequency assignment problem. Technical Report 97\u201327, Ecole Normale Sup\u00e9rieure de Lyon."},{"key":"178_CR154","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/25.289419","volume":"40","author":"M. Zhang","year":"1991","unstructured":"Zhang, M., & Yum, T. P. (1991). The nonuniform compact pattern allocation algorithm for cellular mobile systems. IEEE Transactions on Vehicular Technology, 40, 387\u2013391.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"178_CR155","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/TEMC.1977.303601","volume":"19","author":"J. A. Zoellner","year":"1977","unstructured":"Zoellner, J. A., & Beall, C. L. (1977). A breakthrough in spectrum conserving frequency assignment technology. IEEE Transactions on Electromagnetic Compatibility, 19, 313\u2013319.","journal-title":"IEEE Transactions on Electromagnetic Compatibility"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0178-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-007-0178-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0178-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0178-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T06:42:33Z","timestamp":1707892953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-007-0178-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,12]]},"references-count":155,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0178-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,12]]},"assertion":[{"value":"12 May 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}