{"id":"https://openalex.org/W1480625791","doi":"https://doi.org/10.1109/pimrc.2002.1046529","title":"A heuristic decomposition methodology for channel assignment problems in mobile communication systems","display_name":"A heuristic decomposition methodology for channel assignment problems in mobile communication systems","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W1480625791","doi":"https://doi.org/10.1109/pimrc.2002.1046529","mag":"1480625791"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc.2002.1046529","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2002.1046529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088297319","display_name":"S.Z. Ali","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]},{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"S.Z. Ali","raw_affiliation_strings":["Department of Electrical & Electronic Engineering, Imperial College of Science, Technology and Medicine, University of London, London, UK","Dept. of Electr. & Electron. Eng., Imperial Coll. of Sci. Technol. & Med., London, , UK"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Imperial College of Science, Technology and Medicine, University of London, London, UK","institution_ids":["https://openalex.org/I47508984","https://openalex.org/I124357947"]},{"raw_affiliation_string":"Dept. of Electr. & Electron. Eng., Imperial Coll. of Sci. Technol. & Med., London, , UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088297319"],"corresponding_institution_ids":["https://openalex.org/I124357947","https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03008554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"2175","last_page":"2179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9818000197410583,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7169228196144104},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6774475574493408},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6076972484588623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.590194821357727},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.573269248008728},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5551841855049133},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.5338923335075378},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5164947509765625},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4602282643318176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43086352944374084},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.415368914604187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3359856605529785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3321627378463745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2751253545284271},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14348188042640686},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08429723978042603},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07162168622016907}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7169228196144104},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6774475574493408},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6076972484588623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.590194821357727},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.573269248008728},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5551841855049133},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.5338923335075378},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5164947509765625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4602282643318176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43086352944374084},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.415368914604187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3359856605529785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3321627378463745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2751253545284271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14348188042640686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08429723978042603},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07162168622016907},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pimrc.2002.1046529","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2002.1046529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2114083421","https://openalex.org/W2127081638","https://openalex.org/W2153701831","https://openalex.org/W2161455936","https://openalex.org/W2336259629","https://openalex.org/W4239989490"],"related_works":["https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W4388411807","https://openalex.org/W2364268683","https://openalex.org/W1519906715","https://openalex.org/W2478803962","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3012931947","https://openalex.org/W2035944803"],"abstract_inverted_index":{"The":[0,21,63,76,111,139,154],"paper":[1],"puts":[2],"forward":[3],"an":[4,36],"efficient":[5],"'first":[6],"decompose,":[7],"then":[8,120],"solve'":[9],"solution":[10,102,148],"strategy":[11],"for":[12,35,78],"channel":[13],"assignment":[14,45],"problems":[15],"(CAP)":[16],"in":[17],"cellular":[18],"communications":[19],"systems.":[20],"underlying":[22],"objective":[23],"of":[24,48,95,99,141,156,164],"the":[25,30,55,80,86,96,100,105,144,147,150,157,167,173],"decomposition":[26,65,72,107,159],"technique":[27,82,108,160],"is":[28,68,74,83,109,119,146],"that":[29],"interference":[31,57],"graph":[32],"(IG)":[33],"developed":[34,118],"intractable":[37],"CAP":[38],"be":[39],"broken":[40],"down":[41],"into":[42],"sub-graphs":[43],"(channel":[44],"sub-problems,":[46],"CASPs)":[47],"lower":[49],"complexity":[50],"and":[51,129],"dimensionality":[52],"by":[53],"identifying":[54],"mutual":[56],"patterns":[58],"among":[59],"base":[60],"stations":[61],"(BSs).":[62],"IG":[64,87],"problem":[66],"itself":[67],"NP-complete.":[69],"A":[70],"heuristic":[71,81],"methodology":[73],"presented.":[75],"motivation":[77],"developing":[79],"to":[84,143,149,161],"bi-partition":[85],"using":[88,104,122,172],"minimal":[89],"computational":[90,168],"resources.":[91],"However,":[92],"no":[93],"guarantee":[94],"global":[97],"optimality":[98],"partitioning":[101],"obtained":[103],"proposed":[106,158,174],"provided.":[110],"small-scale":[112],"CASP":[113],"associated":[114,170],"with":[115,171],"each":[116],"subgraph":[117],"solved":[121],"a":[123,162],"conventional":[124],"method":[125],"(see":[126],"Ali,":[127],"S.Z.":[128],"Turner,":[130],"L.F.,":[131],"Proc.":[132],"IEEE":[133],"54th":[134],"VTC,":[135],"vol.l,":[136],"p.389-93,":[137],"2001).":[138],"collection":[140],"solutions":[142],"subproblems":[145],"large-scale":[151],"original":[152],"CAP.":[153],"application":[155],"number":[163],"CAPs":[165],"demonstrates":[166],"advantage":[169],"methodology.":[175]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}