Radio Link Frequency Assignment

The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Constraints : an international journal Ročník 4; číslo 1; s. 79 - 89
Hlavní autoři:	Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Heidelberg Springer 1999 Springer Verlag
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Humanities and Social Sciences Learning and adaptive systems Library and information sciences Office automation, teleprocessing Software Theoretical computing Allocation Algorithm performance Constraint satisfaction NP complete problem Constraint logic programming Radiofrequency Algorithm Optimization Remote data processing radio link frequency assignment benchmarks optimization constraint satisfaction
ISSN:	1383-7133, 1572-9354
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.
AbstractList	The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.
Author	Lobjois, L. Cabon, B. Schiex, T. de Givry, S. Warners, J.P.
Author_xml	– sequence: 1 givenname: B. surname: Cabon fullname: Cabon, B. – sequence: 2 givenname: S. surname: de Givry fullname: de Givry, S. – sequence: 3 givenname: L. surname: Lobjois fullname: Lobjois, L. – sequence: 4 givenname: T. surname: Schiex fullname: Schiex, T. – sequence: 5 givenname: J.P. surname: Warners fullname: Warners, J.P.
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1819988$$DView record in Pascal Francis https://hal.inrae.fr/hal-02695373$$DView record in HAL
BookMark	eNp1kE1LAzEURYNUsK2uXdqFGxdj8_IyncTdUKwVCoLoOmTyodFppk5Gof_eKZWCgqt3eZxzF3dEBrGJjpBzoNdAGU7LG6BUCmCcSon0iAwhL1gmMeeDPqPArADEEzJK6Y32aIF8SC4etQ3NZBXi-2TRuo9PF812UqYUXuLaxe6UHHtdJ3f2c8fkeXH7NF9mq4e7-3m5ygyDosu89YhaGAsg2QyMk2Ats9J6oR31osqRomaV8FXFtfYGheOCM284lxYcjsnVvvdV12rThrVut6rRQS3Lldr9KJvJHAv8gp693LMbnYyufaujCelggQApheixfI-ZtkmpdV6Z0OkuNLFrdagVULUbTpXq13C9N_3jHZr_Mb4Bj8dvAw
CODEN	CNSTFT
CitedBy_id	crossref_primary_10_1609_aimag_v30i2_2233 crossref_primary_10_1007_s10489_020_01860_8 crossref_primary_10_1016_j_artint_2023_103896 crossref_primary_10_1109_TVT_2006_883770 crossref_primary_10_1007_s10601_014_9174_6 crossref_primary_10_1007_s10601_020_09311_4 crossref_primary_10_1007_s10472_013_9351_0 crossref_primary_10_1007_s00224_024_10168_w crossref_primary_10_1007_s10472_010_9212_z crossref_primary_10_1007_s10601_014_9159_5 crossref_primary_10_1016_j_engappai_2010_01_014 crossref_primary_10_1023_B_AIRE_0000036261_28708_7f crossref_primary_10_1145_1412228_1455269 crossref_primary_10_1007_s10601_016_9250_1 crossref_primary_10_1016_S0004_3702_02_00400_9 crossref_primary_10_1016_j_artint_2016_06_005 crossref_primary_10_1007_s10601_006_9002_8 crossref_primary_10_1016_j_artint_2005_02_004 crossref_primary_10_1007_s10601_008_9064_x crossref_primary_10_1016_j_artint_2010_02_001 crossref_primary_10_1016_j_cor_2005_01_016 crossref_primary_10_1007_s10601_016_9245_y crossref_primary_10_1016_j_ejor_2006_12_062 crossref_primary_10_1145_3428214 crossref_primary_10_1007_s10601_016_9248_8 crossref_primary_10_1016_j_endm_2014_11_013 crossref_primary_10_1007_s10732_006_8248_z crossref_primary_10_1287_opre_50_6_968_353 crossref_primary_10_1109_TVT_2003_810976 crossref_primary_10_1007_s10732_021_09475_z crossref_primary_10_1016_j_artint_2004_05_004 crossref_primary_10_1016_j_artint_2009_09_002 crossref_primary_10_1023_A_1025627211942 crossref_primary_10_1007_s10817_010_9176_z crossref_primary_10_1023_A_1020510611031 crossref_primary_10_1007_s10479_007_0178_0 crossref_primary_10_1016_j_ejor_2021_09_014 crossref_primary_10_1109_ACCESS_2017_2690672 crossref_primary_10_1109_TVT_2005_844659 crossref_primary_10_1023_A_1021902812784
Cites_doi	10.1126/science.220.4598.671 10.1016/0004-3702(92)90004-H 10.1016/0004-3702(77)90007-8 10.1007/3-540-61551-2_66 10.1109/IJCNN.1989.118628 10.1007/BFb0017456 10.1142/S0129065789000414
ContentType	Journal Article
Copyright	1999 INIST-CNRS Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: 1999 INIST-CNRS – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION IQODW 1XC BXJBU
DOI	10.1023/A:1009812409930
DatabaseName	CrossRef Pascal-Francis Hyper Article en Ligne (HAL) HAL-SHS: Archive ouverte en Sciences de l'Homme et de la Société
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1572-9354
EndPage	89
ExternalDocumentID	oai:HAL:hal-02695373v1 1819988 10_1023_A_1009812409930
GroupedDBID	-Y2 -~C .86 .VR 06D 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ~EX AAYZH AESKC IQODW 1XC BXJBU
ID	FETCH-LOGICAL-c217t-fdf33a8cd119261ce91dd2d9df8ae0f8b5303a2b8fbb4aafc38e4842fc449d1e3
ISSN	1383-7133
IngestDate	Tue Oct 14 20:03:22 EDT 2025 Mon Jul 21 09:14:13 EDT 2025 Sat Nov 29 07:46:47 EST 2025 Tue Nov 18 21:51:30 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Allocation Algorithm performance Constraint satisfaction NP complete problem Constraint logic programming Radiofrequency Algorithm Optimization Remote data processing radio link frequency assignment benchmarks optimization constraint satisfaction
Language	English
License	https://www.springernature.com/gp/researchers/text-and-data-mining CC BY 4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c217t-fdf33a8cd119261ce91dd2d9df8ae0f8b5303a2b8fbb4aafc38e4842fc449d1e3
ORCID	0000-0001-6049-3415 0000-0002-2242-0458
PageCount	11
ParticipantIDs	hal_primary_oai_HAL_hal_02695373v1 pascalfrancis_primary_1819988 crossref_citationtrail_10_1023_A_1009812409930 crossref_primary_10_1023_A_1009812409930
PublicationCentury	1900
PublicationDate	1999-00-00
PublicationDateYYYYMMDD	1999-01-01
PublicationDate_xml	– year: 1999 text: 1999-00-00
PublicationDecade	1990
PublicationPlace	Heidelberg
PublicationPlace_xml	– name: Heidelberg
PublicationTitle	Constraints : an international journal
PublicationYear	1999
Publisher	Springer Springer Verlag
Publisher_xml	– name: Springer – name: Springer Verlag
References	199166_CR9 199166_CR6 B. Cabon (199166_CR5) 1996 A. K. Mackworth (199166_CR13) 1977; 8 S. Kirkpatrick (199166_CR8) 1983; 220 199166_CR12 199166_CR1 199166_CR11 J.P. Warners (199166_CR21) 1996 199166_CR10 199166_CR20 199166_CR4 199166_CR2 199166_CR3 199166_CR18 T. Schiex (199166_CR17) 1996 H. V. Benthem (199166_CR19) 1995 199166_CR16 E.C. Freuder (199166_CR7) 1992; 58 199166_CR15 C. Peterson (199166_CR14) 1989; 1
References_xml	– ident: 199166_CR3 – ident: 199166_CR1 – ident: 199166_CR12 – ident: 199166_CR11 – ident: 199166_CR16 – volume-title: GRAPH: Generating radio link frequency assignment problems heuristically year: 1995 ident: 199166_CR19 – ident: 199166_CR15 – volume-title: Problèmes d'optimisation combinatoire: évaluation deméthodes de la physique statistique year: 1996 ident: 199166_CR5 – ident: 199166_CR18 – volume: 220 start-page: 671 year: 1983 ident: 199166_CR8 publication-title: Science doi: 10.1126/science.220.4598.671 – ident: 199166_CR9 – ident: 199166_CR10 – volume: 58 start-page: 21 year: 1992 ident: 199166_CR7 publication-title: Artificial Intelligence doi: 10.1016/0004-3702(92)90004-H – volume: 8 start-page: 99 year: 1977 ident: 199166_CR13 publication-title: Artificial Intelligence doi: 10.1016/0004-3702(77)90007-8 – volume-title: A nonlinear approach to a class of combinatorial optimization problems year: 1996 ident: 199166_CR21 – ident: 199166_CR4 – volume-title: Proc. of AAAI-96 year: 1996 ident: 199166_CR17 – ident: 199166_CR2 doi: 10.1007/3-540-61551-2_66 – ident: 199166_CR20 doi: 10.1109/IJCNN.1989.118628 – ident: 199166_CR6 doi: 10.1007/BFb0017456 – volume: 1 start-page: 3 issue: 1 year: 1989 ident: 199166_CR14 publication-title: Int. Journal of Neural Systems doi: 10.1142/S0129065789000414
SSID	ssj0009734
Score	1.8821348
Snippet	The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference...
SourceID	hal pascalfrancis crossref
SourceType	Open Access Repository Index Database Enrichment Source
StartPage	79
SubjectTerms	Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Humanities and Social Sciences Learning and adaptive systems Library and information sciences Office automation, teleprocessing Software Theoretical computing
Title	Radio Link Frequency Assignment
URI	https://hal.inrae.fr/hal-02695373
Volume	4
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9354 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009734 issn: 1383-7133 databaseCode: RSV dateStart: 19970301 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6lhQMSgvISAVosxIGLo3h3He8e06pVD1GFmlD1hLXeBzVUTtSEqPx7Zrx-pQ-pHLhYycRZyzuz89iZ_YaQz2CVYm5MFo5iakJuZRQqyeBrJhG9XFlTFo-fTZKTE3F-Lr_2et_rszDry6QoxPW1XPxXVgMNmI1HZ_-B3c2gQIDPwHS4Atvh-iDGnyqTzzHW_gVeqS-U_oNcyH8UTZVLDU2AziH2iFgty60BVZTwEe0OYfeBZaIi80n6_UFNMiBl-drn4qcNdTLPfs49esGkIU71RW5LWzcbtJsNCFDQ0YwQyoYY0XrDUWnLhIaSeRToWp3yW1LjVaPvGVMbWXmn-u7CSAwl-h7gwFZ5mw2o7BsmrCksLFPqlKXjdGOALfKIJnGCWu90etaCMie-6qB-tRvQT50BNryWrQusmX26UEtYRs73P-k4JbMd8qyKJoKxl4IXpGeLl-R53akjqBT3K_KxFIoAhSJohCJoheI1-XZ0ODs4DqvWGKGGGHIVOuMYU0KbCDz0UaRhjRlDjTQOltfQiSwG10TRTLgs40o5zYTlglOnOZcmsuwN2S7mhX1LgohxpxU4pkxL7pSAnwWNnKHaUmlGsk8G9aunusKNR9G8TO-Z7D750vxh4SFT7r_1E8xlcxdCnR-PJynShnQkY5awddQnuxtT3Q4q8ICoePfw570nTzzsBm6hfSDbq6vfdpc81utVvrzaK4XjL5U3cUk
linkProvider	Springer Nature
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Radio+Link+Frequency+Assignment&rft.jtitle=Constraints+%3A+an+international+journal&rft.au=Cabon%2C+B.&rft.au=de+Givry%2C+S.&rft.au=Lobjois%2C+L.&rft.au=Schiex%2C+T.&rft.date=1999&rft.issn=1383-7133&rft.eissn=1572-9354&rft.volume=4&rft.issue=1&rft.spage=79&rft.epage=89&rft_id=info:doi/10.1023%2FA%3A1009812409930&rft.externalDBID=n%2Fa&rft.externalDocID=10_1023_A_1009812409930
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-7133&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-7133&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-7133&client=summon