{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:17:49Z","timestamp":1773670669958,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0167-739x(00)00046-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:42:44Z","timestamp":1027636964000},"page":"927-935","source":"Crossref","is-referenced-by-count":110,"title":["An ANTS heuristic for the frequency assignment problem"],"prefix":"10.1016","volume":"16","author":[{"given":"Vittorio","family":"Maniezzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonella","family":"Carbonaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(00)00046-7_BIB1","unstructured":"K.I. Aardal, A. Hipolito, S. van Hoesel, B. Jansen, A branch-and-cut algorithm for the frequency assignment problem, Technical Report Annex T-2.2.1 A, CALMA Project, T.U. Eindhoven and T.U. Delft, The Netherlands, 1995."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB2","unstructured":"P.M. Adjakpl\u00e9, B. Jaumard, Greedy and tabu search heuristics for channel block assignment in cellular systems, Technical Report G-97-45, GERAD, Montreal, Canada, 1997."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB3","unstructured":"P. Adjakpl\u00e9, B. Jaumard, A new class of lower bounds on the quality of channel assignment using column generation techniques, Technical Report, GERAD, Montreal, Canada, 1998."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB4","doi-asserted-by":"crossref","first-page":"1294","DOI":"10.1109\/TCOM.1973.1091583","article-title":"A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system","volume":"21","author":"Anderson","year":"1973","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1018908907763","article-title":"Frequency assignment in cellular phone networks","volume":"76","author":"Bornd\u00f6rfer","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB6","unstructured":"R. Bornd\u00f6rfer, A. Eisenbl\u00e4tter, M. Gr\u00f6tschel, A. Martin, The orientation model for frequency assignment problems, Technical Report TR 98\u201301, Konrad\u2013Zuse\u2013Zentrum f\u00fcr Informationstechnik, Berlin, Germany, 1998."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB7","unstructured":"A. Caminada, Resolution du probleme de l\u2019affectation des frequences par programmation par contraintes, Technical Report FT.CNET\/BEL\/POH\/CDI\/71-95\/CA, CNET Belfort, France, 1995."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB8","unstructured":"A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: Proceedings of the ECAL91 \u2014 European Conference on Artificial Life, Elsevier, Amsterdam, 1991, pp. 134\u2013142."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB9","unstructured":"M. Dorigo, A. Colorni, V. Maniezzo, Positive feedback as a search strategy, Technical Report TR91-016, Politecnico di Milano, Italy, 1991."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB10","unstructured":"M. Dorigo, Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale (Optimization, learning and natural algorithms), Ph.D. Thesis, Politecnico di Milano, Italy, 1992 (in Italian)."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB11","doi-asserted-by":"crossref","unstructured":"M. Dorigo, G. Di Caro, The ant colony optimization meta-heuristic, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, London, 1999, pp. 11\u201332.","DOI":"10.1109\/CEC.1999.782657"},{"key":"10.1016\/S0167-739X(00)00046-7_BIB12","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\/S0167-739X(00)00046-7_BIB13","unstructured":"M. Fischetti, C. Lepschy, G. Minerva, G. Romanin Jacur, E. Toto, Frequency assignment in mobile radio system using branch-and-cut techniques, in: Proceedings of the AIRO\u201996 Meeting, Italy, 1996, pp. 312\u2013314."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB14","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/25.182594","article-title":"A neural network parallel algorithm for channel assignment problems in cellular radio network","volume":"41","author":"Funabiki","year":"1992","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB15","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\/S0167-739X(00)00046-7_BIB16","doi-asserted-by":"crossref","unstructured":"A.I. Giortzis, L.F. Turner, A mathematical programming approach to the channel assignment problem in radio networks, in: Proceedings of the IEEE 46 Vehicular Technology Conference, Vol. 2, 1996, pp. 736\u2013740.","DOI":"10.1109\/VETEC.1996.501409"},{"key":"10.1016\/S0167-739X(00)00046-7_BIB17","doi-asserted-by":"crossref","unstructured":"W.K. Hale, Frequency assignment: theory and applications, Proceedings of the IEEE, Vol. 68, 1980, pp. 1497\u20131514.","DOI":"10.1109\/PROC.1980.11899"},{"key":"10.1016\/S0167-739X(00)00046-7_BIB18","unstructured":"C.A.J. Hurkens, S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, Technical Report 95-34, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands, 1995."},{"issue":"5","key":"10.1016\/S0167-739X(00)00046-7_BIB19","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1029\/97RS01866","article-title":"FASoft: a system for discrete channel frequency assignment","volume":"32","author":"Hurley","year":"1997","journal-title":"Radio Sci."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB20","doi-asserted-by":"crossref","unstructured":"A. Koster, S. van Hoesel, A. Kolen, The partial constraint satisfaction problem: facets and lifting theorems, Technical Report RM 97\/005, University of Maastricht, The Netherlands, 1997.","DOI":"10.1016\/S0167-6377(98)00043-1"},{"key":"10.1016\/S0167-739X(00)00046-7_BIB21","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","article-title":"Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem","volume":"11","author":"Maniezzo","year":"1999","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB22","unstructured":"V. Maniezzo, A. Carbonaro, Ant colony optimization: an overview, in: Proceedings of the Third Metaheuristics International Conference, Brazil, 1999."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB23","doi-asserted-by":"crossref","unstructured":"C. Mannino, A. Sassano, An enumerative algorithm for the frequency assignment problem, Discrete Appl. Math., submitted.","DOI":"10.1016\/S0166-218X(02)00239-1"},{"key":"10.1016\/S0167-739X(00)00046-7_BIB24","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\/S0167-739X(00)00046-7_BIB25","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":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/S0167-739X(00)00046-7_BIB26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/90.554720","article-title":"A new lower bound for the frequency assignment problem","volume":"5","author":"Tcha","year":"1997","journal-title":"IEEE Trans. Networking"},{"key":"10.1016\/S0167-739X(00)00046-7_BIB27","unstructured":"S. Tiourine, C. Hurkens, J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, Technical Report T.U. Eindhoven, The Netherlands, 1995."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB28","unstructured":"H.P. van Benthem, GRAPH: generating radio link frequency assignment problems heuristically, Master\u2019s Thesis, Faculty of Technical Mathematics and Informatics, T.U. Delft, The Netherlands, 1995."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB29","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(96)00139-4","article-title":"Potential reduction approach to the frequency assignment problem","volume":"78","author":"Warners","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-739X(00)00046-7_BIB30","doi-asserted-by":"crossref","unstructured":"J.A. Zoellner, C.L. Beall, A breakthrough in spectrum conserving frequency assignment technology, IEEE Trans. Electromagnetic Compatibility (1977) 313\u2013319.","DOI":"10.1109\/TEMC.1977.303601"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000467?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000467?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:36:51Z","timestamp":1580859411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X00000467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0167739X00000467"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(00)00046-7","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}