{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:13:46Z","timestamp":1769829226151,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":["Constraints"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1009812409930","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"79-89","source":"Crossref","is-referenced-by-count":106,"title":["Radio Link Frequency Assignment"],"prefix":"10.1007","volume":"4","author":[{"given":"B.","family":"Cabon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"de Givry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Lobjois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Schiex","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.P.","family":"Warners","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"199166_CR1","unstructured":"C. Bessi\u00e8re, E.C. Freuder, and J.C. R\u00e9gin (1995). Using inference to reduce arc-consistency computation. In Proc. of the 14th IJCAI, Montr\u00e9al, Canada."},{"key":"199166_CR2","doi-asserted-by":"crossref","unstructured":"Christian Bessi\u00e8re and Jean-Charles R\u00e9gin (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proc. of the Second International Conference on Principles and Practice of Constraint Programming, Cambridge, MA.","DOI":"10.1007\/3-540-61551-2_66"},{"key":"199166_CR3","unstructured":"S. Bistarelli, U. Montanari, and F. Rossi (1995). Constraint solving over semirings. In Proc. of the 14th IJCAI, Montr\u00e9al, Canada."},{"key":"199166_CR4","unstructured":"Ir. A.A.F. Bloemen (1992). Frequency assignment in mobile telecommunication networks. Technical report, Tech. Universiteit Eindhoven."},{"key":"199166_CR5","volume-title":"Probl\u00e8mes d'optimisation combinatoire: \u00e9valuation dem\u00e9thodes de la physique statistique","author":"B. Cabon","year":"1996","unstructured":"B. Cabon (1996). Probl\u00e8mes d'optimisation combinatoire: \u00e9valuation dem\u00e9thodes de la physique statistique. Th\u00e8se, ENSAE, Toulouse, France."},{"key":"199166_CR6","doi-asserted-by":"crossref","unstructured":"S. de Givry, G. Verfaillie, and T. Schiex (1997). Bounding the Optimum of Constraint Optimization Problems. In Proc. of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Schloss Hagenberg, Austria.","DOI":"10.1007\/BFb0017456"},{"key":"199166_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"E.C. Freuder and R.J. Wallace (1992). Partial constraint satisfaction. Artificial Intelligence, 58:21\u201370.","journal-title":"Artificial Intelligence"},{"key":"199166_CR8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi (1983). Optimization by simulated annealing. Science, 220:671\u2013680.","journal-title":"Science"},{"key":"199166_CR9","unstructured":"A. Kolen (1994). A constraint satisfaction approach to the radio link frequency assignment problem. Technical Report 2.2.2, EUCLID CALMA project, 1994. Available at ftp:\/\/ftp.win.tue.nl\/pub\/ techreports\/ CALMA\/222.ps."},{"key":"199166_CR10","unstructured":"A. Kolen (1996). Results on infeasible instances of the RLFAP. Personal communication."},{"key":"199166_CR11","unstructured":"A. Kolen (forthcoming). A genetic algorithm for the partial binary satisfaction problem: An application to a frequency assignment problem. Technical report, University of Maastricht, Maastricht, The Netherlands."},{"key":"199166_CR12","unstructured":"T.A. Lanfear (1989). Graph theory and radio frequency assignment. Technical report, NATO, Allied Radio Frequency Agency."},{"key":"199166_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"A. K. Mackworth (1977). Consistency in networks of relations. Artificial Intelligence, 8:99\u2013118.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"199166_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0129065789000414","volume":"1","author":"C. Peterson","year":"1989","unstructured":"C. Peterson and B. Soderberg (1989). A new method for mapping optimization problems onto neural networks. Int. Journal of Neural Systems, 1(1):3\u201322.","journal-title":"Int. Journal of Neural Systems"},{"key":"199166_CR15","unstructured":"C. Roisnel (1993). \u00c9tude comparative d'outils de programmation par contraintes \u2013 synth\u00e8se et r\u00e9sultats.Technical Report ITES\/555-93\/RS 10539, CELAR."},{"key":"199166_CR16","unstructured":"T. Schiex, H. Fargier, and G. Verfaillie (1995). Valued constraint satisfaction problems: hard and easy problems. In Proc. of the 14th IJCAI, pages 631\u2013637, Montr\u00e9al, Canada."},{"key":"199166_CR17","volume-title":"Proc. of AAAI-96","author":"T. Schiex","year":"1996","unstructured":"T. Schiex, J.-C. R\u00e9gin, C. Gaspin, and G. Verfaillie (1996). Lazy arc consistency. In Proc. of AAAI-96, Portland, OR, AAAI Press."},{"key":"199166_CR18","unstructured":"S. Tiourine, C. Hurkens, and J.K. Lenstra (1995). An overview of algorithmic approaches to frequency assignment problems. Technical report, EUCLID CALMA project, Eindhoven University of Technology.Available at ftp:\/\/ftp.win.tue.nl\/pub\/techreports\/CALMA\/overview.ps."},{"key":"199166_CR19","volume-title":"GRAPH: Generating radio link frequency assignment problems heuristically","author":"H. V. Benthem","year":"1995","unstructured":"H.P. Van Benthem (1995). GRAPH: Generating radio link frequency assignment problems heuristically. Master's thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands."},{"key":"199166_CR20","doi-asserted-by":"crossref","unstructured":"D.E. Van den Bout and T.K. Miller (1989). Graph Partitioning using Annealed Neural Networks. In Proc. of IJCNN-89, pages 521\u2013528, Washington.","DOI":"10.1109\/IJCNN.1989.118628"},{"key":"199166_CR21","series-title":"Technical Report","volume-title":"A nonlinear approach to a class of combinatorial optimization problems","author":"J.P. Warners","year":"1996","unstructured":"J.P. Warners (1996). A nonlinear approach to a class of combinatorial optimization problems. Technical Report 96\u2013119, Delft University of Technology, Delft, The Netherlands. To appear in Statistica Neerlandica."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009812409930.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009812409930\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009812409930.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:10Z","timestamp":1752379810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009812409930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["199166"],"URL":"https:\/\/doi.org\/10.1023\/a:1009812409930","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}