{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T12:46:35Z","timestamp":1761741995766},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00239-1","type":"journal-article","created":{"date-parts":[[2002,10,30]],"date-time":"2002-10-30T16:44:51Z","timestamp":1035996291000},"page":"155-169","source":"Crossref","is-referenced-by-count":35,"title":["An enumerative algorithm for the frequency assignment problem"],"prefix":"10.1016","volume":"129","author":[{"given":"Carlo","family":"Mannino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00239-1_BIB1","unstructured":"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."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB2","unstructured":"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\u2013250."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02125459","article-title":"A tabu search algorithm for frequency assignment","volume":"63","author":"Castelino","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02023000","article-title":"On the use of some known methods for T-colourings of graphs","volume":"41","author":"Costa","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB5","doi-asserted-by":"crossref","unstructured":"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\u201384.","DOI":"10.1117\/12.179242"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/25.192382","article-title":"Channel assignment for cellular radio using simulated annealing","volume":"42","author":"Duque-Anton","year":"1993","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB7","doi-asserted-by":"crossref","unstructured":"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\u2013255.","DOI":"10.1016\/S0377-2217(99)00254-4"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","article-title":"Some lower bounds for a class of frequency assignment problems","volume":"35","author":"Gamst","year":"1986","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB9","series-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","first-page":"285","article-title":"Coloring by tabu branch and bound","volume":"Vol. 26","author":"Glover","year":"1996"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB10","series-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","first-page":"285","article-title":"Constructing cliques using restricted backtracking","volume":"Vol. 26","author":"Goldberg","year":"1996"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB11","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB12","doi-asserted-by":"crossref","unstructured":"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\u2013257.","DOI":"10.1145\/331119.331186"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB13","unstructured":"J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (I) Tours, Technical Report CDAM-96-17, London School of Economics, and on 1996."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB14","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/25.312792","article-title":"A two phase algorithm for frequency assignment in cellular mobile systems","volume":"43","author":"Kim","year":"1994","journal-title":"IEEE Trans. Vehicular Technol."},{"issue":"1","key":"10.1016\/S0166-218X(02)00239-1_BIB15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/25.69987","article-title":"Channel assignment for cellular radio using neural networks","volume":"40","author":"Kunz","year":"1991","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB16","unstructured":"R. Leese, Tiling methods for channel assignment in radio communication networks, in: Proceedings of the Third ICIAM Congress, 1996."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB17","doi-asserted-by":"crossref","unstructured":"G.D. Lochtie, M.J. Mehler, Channel assignment using a subspace approach to neural networks, IEE Antennas Propagation (1995) 296\u2013300.","DOI":"10.1049\/cp:19950436"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB18","series-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","first-page":"359","article-title":"An improved algorithm for exact graph coloring","volume":"Vol. 26","author":"Sewell","year":"1996"},{"key":"10.1016\/S0166-218X(02)00239-1_BIB19","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0012-365X(96)00257-9","article-title":"Bounds for the frequency assignment problem","volume":"167\/168","author":"Smith","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00239-1_BIB20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0377-2217(98)80006-4","article-title":"Improving heuristics for the frequency assignment problem","volume":"107","author":"Smith","year":"1998","journal-title":"Eur. J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:38:07Z","timestamp":1580877487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02002391"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00239-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}