{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T21:04:58Z","timestamp":1778187898248,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1019100324508","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"293-314","source":"Crossref","is-referenced-by-count":24,"title":["Local search algorithms for the radio link frequency assignment problem"],"prefix":"10.1007","volume":"13","author":[{"given":"S.R.","family":"Tiourine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.A.J.","family":"Hurkens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.K.","family":"Lenstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329785_CR1","first-page":"1","volume":"9","author":"K. Aardal","year":"1996","unstructured":"K. Aardal, C.A.J. Hurkens, J.K. Lenstra and S.R. Tiourine, Algorithms for frequency assignment problems, CWI Quarterly 9 (1996) 1\u20138.","journal-title":"CWI Quarterly"},{"key":"329785_CR2","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Networks","author":"E.H.L. Aarts","year":"1989","unstructured":"E.H.L. Aarts and J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Networks (Wiley, Chichester, UK, 1989)."},{"key":"329785_CR3","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"E.H.L. Aarts and J.K. Lenstra, eds., Local Search in Combinatorial Optimization (Wiley, Chichester, UK, 1997)."},{"key":"329785_CR4","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"E. Balas and A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Management Science 44 (1998) 262\u2013275.","journal-title":"Management Science"},{"key":"329785_CR5","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1976","unstructured":"C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1976)."},{"key":"329785_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/360336.360343","volume":"9","author":"J.R. Bitner","year":"1976","unstructured":"J.R. Bitner, G. Ehrlich and E.M. Reingold, Efficient generation of the binary reflected Gray code and its applications, Communications of the ACM 9 (1976) 517\u2013521.","journal-title":"Communications of the ACM"},{"key":"329785_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"D. Br\u00e9laz","year":"1973","unstructured":"D. Br\u00e9laz, New methods to color the vertices of a graph, Communications of the ACM 16 (1973) 575\u2013577.","journal-title":"Communications of the ACM"},{"key":"329785_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"F. Glover and M. Laguna, Tabu Search (Kluwer Academic, Boston, 1997)."},{"key":"329785_CR9","volume-title":"Digital Satellite Communications","author":"T.T. Ha","year":"1990","unstructured":"T.T. Ha, Digital Satellite Communications (McGraw-Hill, New York, 1990)."},{"key":"329785_CR10","unstructured":"W. Hajema, M. Minoux and C. West, Statement of the radio link frequency assignment problem, Technical Report, Request for proposals on the CALMA project (1993)."},{"key":"329785_CR11","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68 (1980) 1497\u20131514.","journal-title":"Proceedings of the IEEE"},{"key":"329785_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009690321348","volume":"4","author":"J.-K. Hao","year":"1998","unstructured":"J.-K. Hao, R. Dorne and P. Galinier, Tabu search for frequency assignment in mobile radio networks, Journal of Heuristics 4 (1998) 47\u201362.","journal-title":"Journal of Heuristics"},{"key":"329785_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal 49 (1970) 291\u2013307.","journal-title":"The Bell System Technical Journal"},{"key":"329785_CR14","series-title":"Technical Report","volume-title":"Constraint satisfaction","author":"A.W.J. Kolen","year":"1995","unstructured":"A.W.J. Kolen and C.P.M. Van Hoesel, Constraint satisfaction, Technical Report CALMA 2.2.2, Centre d'Etudes et de Recherches de Toulouse, France (1995); also available at http:\/\/www. win.tue.nl\/_wscor\/calma.html."},{"key":"329785_CR15","unstructured":"A.M.C.A. Koster and C.P.M. Van Hoesel, Private communication, Maastricht University (1998), e-mail: A.Koster@ke.unimaas.nl."},{"key":"329785_CR16","series-title":"Technical Report","volume-title":"Graph theory and radio frequency assignment","author":"T.A. Lanfear","year":"1989","unstructured":"T.A. Lanfear, Graph theory and radio frequency assignment, Technical Report, Allied Radio Frequency Agency, NATO Headquarters, Brussels (1989)."},{"key":"329785_CR17","volume-title":"Mobile Cellular Telecommunications: Analog and Digital Systems","author":"W.C.Y. Lee","year":"1995","unstructured":"W.C.Y. Lee, Mobile Cellular Telecommunications: Analog and Digital Systems (McGraw-Hill, New York, 1995)."},{"key":"329785_CR18","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Operations Research 21 (1973) 498\u2013511.","journal-title":"Operations Research"},{"key":"329785_CR19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Management Science 42 (1996) 797\u2013813.","journal-title":"Management Science"},{"key":"329785_CR20","volume-title":"Foundations of Constraint Satisfaction","author":"E.P.K. Tsang","year":"1993","unstructured":"E.P.K. Tsang, Foundations of Constraint Satisfaction (Academic Press, London, 1993)."},{"key":"329785_CR21","doi-asserted-by":"crossref","unstructured":"W.H.W. Tuttlebee, ed., Cordless Telecommunications in Europe: The Evolution of Personal Communications (Springer, Berlin, 1990).","DOI":"10.1007\/978-1-4471-3262-2"},{"key":"329785_CR22","volume-title":"Graph: A test case generator","author":"H.P. Van Benthem","year":"1995","unstructured":"H.P. Van Benthem, Graph: A test case generator, Master' thesis, Delft University of Technology, Netherlands (1995)."},{"key":"329785_CR23","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/trsc.27.3.298","volume":"27","author":"L.J.J. Van der Bruggen","year":"1993","unstructured":"L.J.J. Van der Bruggen, J.K. Lenstra and P.C. Schuur, Variable-depth search for the single-vehicle pickup and delivery problem with time windows, Transportation Science 27 (1993) 298\u2013311.","journal-title":"Transportation Science"},{"key":"329785_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Van Laarhoven","year":"1992","unstructured":"P.J.M. Van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Operations Research 40 (1992) 113\u2013125.","journal-title":"Operations Research"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019100324508.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019100324508\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019100324508.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:23:50Z","timestamp":1754634230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019100324508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":24,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["329785"],"URL":"https:\/\/doi.org\/10.1023\/a:1019100324508","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}