On optimization formulations for radio resource allocation subject to common transmission rate

We study a radio resource allocation problem in mobile communication systems. As the distinct characteristic of this problem, a common data transmission rate is used on all channels allocated to a user. Because the channels differ in their quality, for each user the achievable rate varies by channel...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 161; p. 106427
Main Authors Zhao, Yi, Yuan, Di
Format Journal Article
LanguageEnglish
Published 01.01.2024
Subjects
Integer programming
Modeling
Radio resource allocation
Online AccessGet full text
ISSN0305-0548
1873-765X
DOI10.1016/j.cor.2023.106427

Cover

Abstract We study a radio resource allocation problem in mobile communication systems. As the distinct characteristic of this problem, a common data transmission rate is used on all channels allocated to a user. Because the channels differ in their quality, for each user the achievable rate varies by channel. Thus allocating more channels does not necessarily increase the total rate, as the common rate is constrained to be the lowest one supported by the allocated channels. Radio resource allocation subject to the common-rate constraint is of practical relevance, though little attention has been paid to modeling and solving the problem. We take a mathematical optimization perspective with focus on modeling. We first provide a complexity analysis. Next, several integer linear programming (ILP) formulations for the problem, including compact as well as non-compact models, are derived. The bulk of our analysis consists in a rigorous comparative study of their linear programming (LP) relaxations, to reveal the relationship between the formulations in terms of bounding. Computational experiments are presented to illustrate the numerical performance in bounding and LP-assisted problem solving. Our theoretical analysis and numerical results together serve the aim of setting a ground for the next step of developing model-based and tailored optimization methods.
AbstractList We study a radio resource allocation problem in mobile communication systems. As the distinct characteristic of this problem, a common data transmission rate is used on all channels allocated to a user. Because the channels differ in their quality, for each user the achievable rate varies by channel. Thus allocating more channels does not necessarily increase the total rate, as the common rate is constrained to be the lowest one supported by the allocated channels. Radio resource allocation subject to the common-rate constraint is of practical relevance, though little attention has been paid to modeling and solving the problem. We take a mathematical optimization perspective with focus on modeling. We first provide a complexity analysis. Next, several integer linear programming (ILP) formulations for the problem, including compact as well as non-compact models, are derived. The bulk of our analysis consists in a rigorous comparative study of their linear programming (LP) relaxations, to reveal the relationship between the formulations in terms of bounding. Computational experiments are presented to illustrate the numerical performance in bounding and LP-assisted problem solving. Our theoretical analysis and numerical results together serve the aim of setting a ground for the next step of developing model-based and tailored optimization methods.
ArticleNumber 106427
Author Zhao, Yi
Yuan, Di
Author_xml – sequence: 1
  givenname: Yi
  orcidid: 0000-0002-6025-3515
  surname: Zhao
  fullname: Zhao, Yi
– sequence: 2
  givenname: Di
  surname: Yuan
  fullname: Yuan, Di
BackLink https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-515465$$DView record from Swedish Publication Index
BookMark eNo9kMtOwzAQRb0oEm3hA9j5A0jxM49lVR5FqtQNsMSaOjZylMSV7QjB15MQxGxm7tw7szgrtOh9bxC6oWRDCc3vmo32YcMI46POBSsWaEk4kRmRorxEqxgbMlbB6BK9H3vsz8l17huS8z22PnRD-zvHSeAAtfM4mOiHoA2GtvV6jsbh1BidcPJY-64bNylAHzsX42QHSOYKXVhoo7n-62v0-vjwsttnh-PT8257yDSXImWGCGA51yBqYa3QIteSE2Ast5azui4qU1Z1pbmpJAVO6kKX5ehrAFuBYXyNbue_8dOch5M6B9dB-FIenLp3b1vlw4caBiWpFLkc43SO6-BjDMb-H1CiJoaqUSNDNTFUM0P-A9JhbQg
Cites_doi 10.1109/TWC.2008.060723.
10.1109/TSP.2013.2293130
10.1109/LWC.2014.2352655
10.1186/s13638-020-01798-y
10.1109/TWC.2009.080221
10.1109/TNET.2009.2022937
10.1109/TSP.2016.2548998
10.1016/j.ejor.2009.09.018
10.1016/j.cor.2018.08.011
10.1002/wcm.2610
10.1109/TVT.2012.2225854
10.1109/MCOM.2018.1701031
10.1287/ijoc.8.4.344
10.1109/TCOMM.2017.2678986
10.1007/s10589-017-9914-9
10.1112/jlms/s1-10.37.26
10.1109/TWC.2012.083112.111951
10.1109/TNET.2021.3118005
10.1016/j.comnet.2013.05.003
10.1049/iet-net.2012.0007
10.1109/JSAC.2014.141213
ContentType Journal Article
DBID AAYXX
CITATION
ACNBI
ADTPV
AOWAS
D8T
DF2
ZZAVC
DOI 10.1016/j.cor.2023.106427
DatabaseName CrossRef
SWEPUB Uppsala universitet full text
SwePub
SwePub Articles
SWEPUB Freely available online
SWEPUB Uppsala universitet
SwePub Articles full text
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
ExternalDocumentID oai_DiVA_org_uu_515465
10_1016_j_cor_2023_106427
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AAEDT
AAEDW
AAFJI
AAIKJ
AAKOC
AALRI
AAOAW
AAQXK
AARIN
AATTM
AAXKI
AAXUO
AAYFN
AAYOK
AAYWO
AAYXX
ABAOU
ABBOA
ABDPE
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABWVN
ABXDB
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADGUI
ADJOM
ADMUD
ADNMO
AEBSH
AEFWE
AEHXG
AEIPS
AEKER
AENEX
AEUPX
AFFNX
AFJKZ
AFPUW
AFTJW
AFXIZ
AGCQF
AGHFR
AGQPQ
AGRNS
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGII
AIGVJ
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOMHK
AOUOD
APLSM
APXCP
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
BNPGV
CITATION
CS3
DU5
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSH
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UPT
VH1
WUQ
XPP
ZMT
~02
~G-
ACNBI
ADTPV
AOWAS
D8T
DF2
EFKBS
EFLBG
ZZAVC
ID FETCH-LOGICAL-c354t-e04a263ca4d4ff4c46c530a226ff32dd79e89d9c3e951a30d7c880a2caaf9ae23
ISSN 0305-0548
1873-765X
IngestDate Tue Sep 09 23:47:02 EDT 2025
Tue Jul 01 02:06:39 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c354t-e04a263ca4d4ff4c46c530a226ff32dd79e89d9c3e951a30d7c880a2caaf9ae23
ORCID 0000-0002-6025-3515
OpenAccessLink https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-515465
ParticipantIDs swepub_primary_oai_DiVA_org_uu_515465
crossref_primary_10_1016_j_cor_2023_106427
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-01-00
2024
PublicationDateYYYYMMDD 2024-01-01
PublicationDate_xml – month: 01
  year: 2024
  text: 2024-01-00
PublicationDecade 2020
PublicationTitle Computers & operations research
PublicationYear 2024
References (10.1016/j.cor.2023.106427_b11) 1999
Hall (10.1016/j.cor.2023.106427_b16) 1935; 10
Wang (10.1016/j.cor.2023.106427_b29) 2017; 65
Lin (10.1016/j.cor.2023.106427_b21) 2009; 8
Ng (10.1016/j.cor.2023.106427_b26) 2012; 11
Ng (10.1016/j.cor.2023.106427_b27) 2008; 7
Calabrese (10.1016/j.cor.2023.106427_b7) 2018; 56
Ecker (10.1016/j.cor.2023.106427_b14) 2019; 101
Al-Kanj (10.1016/j.cor.2023.106427_b3) 2015; 16
D’Andreagiovanni (10.1016/j.cor.2023.106427_b12) 2012; 54
Joung (10.1016/j.cor.2023.106427_b18) 2012; 1
3GPP (10.1016/j.cor.2023.106427_b1) 2018
Chen (10.1016/j.cor.2023.106427_b9) 2010; 203
Huang (10.1016/j.cor.2023.106427_b17) 2021; 30
Berman (10.1016/j.cor.2023.106427_b5) 2003; TR03-049
Bioardi (10.1016/j.cor.2023.106427_b6) 2013; 57
Mehrotra (10.1016/j.cor.2023.106427_b25) 1995; 8
Tse (10.1016/j.cor.2023.106427_b28) 2005
Dreifuerst (10.1016/j.cor.2023.106427_b13) 2021
Lopez-Perez (10.1016/j.cor.2023.106427_b24) 2014; 32
Yuan (10.1016/j.cor.2023.106427_b31) 2012; 62
3GPP (10.1016/j.cor.2023.106427_b2) 2018
Wolsey (10.1016/j.cor.2023.106427_b30) 2020
Cohen (10.1016/j.cor.2023.106427_b10) 2010; 18
Liu (10.1016/j.cor.2023.106427_b22) 2014; 3
Fallgren (10.1016/j.cor.2023.106427_b15) 2010
Ali (10.1016/j.cor.2023.106427_b4) 2020; 2020
Letchford (10.1016/j.cor.2023.106427_b20) 2017; 68
Kuang (10.1016/j.cor.2023.106427_b19) 2016; 64
Chen (10.1016/j.cor.2023.106427_b8) 2021
Liu (10.1016/j.cor.2023.106427_b23) 2014; 62
References_xml – volume: 7
  start-page: 1667
  issue: 5
  year: 2008
  ident: 10.1016/j.cor.2023.106427_b27
  article-title: Low complexity subcarrier and power allocation for utility maximization in uplink OFDMA systems
  publication-title: IEEE Trans. Wireless Commun.
  doi: 10.1109/TWC.2008.060723.
– year: 2005
  ident: 10.1016/j.cor.2023.106427_b28
– volume: 62
  start-page: 583
  issue: 3
  year: 2014
  ident: 10.1016/j.cor.2023.106427_b23
  article-title: On the complexity of joint subcarrier and power allocation for multi-user OFDMA systems
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2013.2293130
– year: 1999
  ident: 10.1016/j.cor.2023.106427_b11
– volume: 3
  start-page: 661
  year: 2014
  ident: 10.1016/j.cor.2023.106427_b22
  article-title: Complexity analysis of joint subcarrier and power allocation for the cellular downlink OFDMA system
  publication-title: IEEE Wireless Commun. Lett.
  doi: 10.1109/LWC.2014.2352655
– volume: 2020
  year: 2020
  ident: 10.1016/j.cor.2023.106427_b4
  article-title: Planning capacity for 5G and beyond wireless networks by discrete fireworks algorithm with ensemble of local search methods
  publication-title: EURASIP J. Wireless Commun. Networking
  doi: 10.1186/s13638-020-01798-y
– volume: 8
  start-page: 4066
  year: 2009
  ident: 10.1016/j.cor.2023.106427_b21
  article-title: Optimal and near-optimal resource allocation algorithms for OFDMA networks
  publication-title: IEEE Trans. Wireless Commun.
  doi: 10.1109/TWC.2009.080221
– volume: 18
  start-page: 15
  year: 2010
  ident: 10.1016/j.cor.2023.106427_b10
  article-title: Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/TNET.2009.2022937
– volume: 64
  start-page: 3388
  year: 2016
  ident: 10.1016/j.cor.2023.106427_b19
  article-title: Optimal joint user association and multi-pattern resource allocation in heterogeneous networks
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2016.2548998
– start-page: 1
  year: 2010
  ident: 10.1016/j.cor.2023.106427_b15
  article-title: On the complexity of maximizing the minimum Shannon capacity in wireless networks by joint channel assignment and power allocation
– volume: 203
  start-page: 714
  year: 2010
  ident: 10.1016/j.cor.2023.106427_b9
  article-title: Solving a minimum-power covering problem with overlap constraint for cellular network design
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2009.09.018
– year: 2018
  ident: 10.1016/j.cor.2023.106427_b2
– volume: 101
  start-page: 1
  year: 2019
  ident: 10.1016/j.cor.2023.106427_b14
  article-title: Accurate optimization models for interference constrained bandwidth allocation in cellular networks
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2018.08.011
– year: 2020
  ident: 10.1016/j.cor.2023.106427_b30
– year: 2021
  ident: 10.1016/j.cor.2023.106427_b13
  article-title: Optimizing coverage and capacity in cellular networks using machine learning
– volume: 16
  start-page: 1537
  year: 2015
  ident: 10.1016/j.cor.2023.106427_b3
  article-title: Optimized joint cell planning and BS on/off switching for LTE networks
  publication-title: Wirel. Commun. Mob. Comput.
  doi: 10.1002/wcm.2610
– volume: 54
  start-page: 142
  year: 2012
  ident: 10.1016/j.cor.2023.106427_b12
  article-title: GUB covers and power-indexed formulations for wireless network design
  publication-title: Manage. Sci.
– year: 2018
  ident: 10.1016/j.cor.2023.106427_b1
– volume: 62
  start-page: 863
  year: 2012
  ident: 10.1016/j.cor.2023.106427_b31
  article-title: On tractability aspects of optimal resource allocation in OFDMA systems
  publication-title: IEEE Trans. Veh. Technol.
  doi: 10.1109/TVT.2012.2225854
– volume: 56
  start-page: 138
  year: 2018
  ident: 10.1016/j.cor.2023.106427_b7
  article-title: Learning radio resource management in 5G networks: Framework, opportunities and challenges
  publication-title: IEEE Commun. Mag.
  doi: 10.1109/MCOM.2018.1701031
– volume: 8
  start-page: 344
  year: 1995
  ident: 10.1016/j.cor.2023.106427_b25
  article-title: A column generation approach for graph coloring
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.8.4.344
– volume: 65
  start-page: 2672
  year: 2017
  ident: 10.1016/j.cor.2023.106427_b29
  article-title: Joint optimization of user association, subchannel allocation, and power allocation in multi-cell multi-association OFDMA heterogeneous networks
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2017.2678986
– volume: 68
  start-page: 193
  year: 2017
  ident: 10.1016/j.cor.2023.106427_b20
  article-title: An exact algorithm for a resource allocation problem in mobile wireless communications
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-017-9914-9
– volume: 10
  start-page: 26
  year: 1935
  ident: 10.1016/j.cor.2023.106427_b16
  article-title: On representatives of subsets
  publication-title: J. Lond. Math. Soc.
  doi: 10.1112/jlms/s1-10.37.26
– year: 2021
  ident: 10.1016/j.cor.2023.106427_b8
  article-title: mCore: Achieving sub-millisecond scheduling for 5G MU-MIMO systenms
– volume: 11
  start-page: 3618
  year: 2012
  ident: 10.1016/j.cor.2023.106427_b26
  article-title: Energy-efficient resource allocation in multicell OFDMA systems with limited backhaul capacity
  publication-title: IEEE Trans. Wireless Commun.
  doi: 10.1109/TWC.2012.083112.111951
– volume: 30
  start-page: 601
  year: 2021
  ident: 10.1016/j.cor.2023.106427_b17
  article-title: GPF+: A novel ultrafast GPU-based proportional fair scheduler for 5G NR
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/TNET.2021.3118005
– volume: TR03-049
  year: 2003
  ident: 10.1016/j.cor.2023.106427_b5
  article-title: Approximation hardness of short symmetric instances of MAX-3SAT
  publication-title: Electron. Colloquium Comput. Complex.
– volume: 57
  start-page: 2564
  year: 2013
  ident: 10.1016/j.cor.2023.106427_b6
  article-title: Radio planning of energy-aware cellular networks
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2013.05.003
– volume: 1
  start-page: 66
  year: 2012
  ident: 10.1016/j.cor.2023.106427_b18
  article-title: Energy efficient network-flow-based algorithm for multiuser multicarrier systems
  publication-title: IET Networks
  doi: 10.1049/iet-net.2012.0007
– volume: 32
  start-page: 333
  year: 2014
  ident: 10.1016/j.cor.2023.106427_b24
  article-title: Power minimization based resource allocation for interference mitigation in OFDMA femtocell networks
  publication-title: IEEE J. Sel. Areas Commun.
  doi: 10.1109/JSAC.2014.141213
SSID ssj0000721
Score 2.4193027
Snippet We study a radio resource allocation problem in mobile communication systems. As the distinct characteristic of this problem, a common data transmission rate...
SourceID swepub
crossref
SourceType Open Access Repository
Index Database
StartPage 106427
SubjectTerms Integer programming
Modeling
Radio resource allocation
Title On optimization formulations for radio resource allocation subject to common transmission rate
URI https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-515465
Volume 161
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELagSAgOBRYQpYB8gAsrV1b8SHOs2qIKCXpp0cKByPGjbKVuqjS59NDfzvi1m4UeCpcosaIkms-efP48M0bovQSWURWKEco1J7yilDTWcKK5VIVwxkrnJ4pfvsqjU_55Jmar_TFDdknf7OjrW_NK_gdVaANcfZbsPyC7fCg0wDngC0dAGI53wvgYuB4M-YuUSxkyEYcc3ObjBztl5u20SxL91C-yR4luejU0XoHx1BO-7MIvGfi_FqDu5bOpLyAx5q1584er0FXaS9ult6RiQUtR-ccvFcTX7_OlPxmixnowHysMMaU5ucPdkpFSitmav4zV0__yvVEGOAd7-jqrBYMWmNyUqx_NWknrg_m3vbrtzuphqIFTcSnuowdFKaXfhmLnZhWn4wu4xaUgQYBfhtzG_Fl5mToE7P3x3jWisVYGNlCHk6doM3F-vBcBfIbu2cUEPcwpBxP0JFsXJ087QY9HdSKfo5_HCzwGGo-B9hc4AI0z0HgFNE5A477FEWg8Bhp7oF-g00-HJ_tHJG2MQTQTvCeWclVIphU33DkYZFILRhUwaedYYUxZ2d3KVJpZ4M-KUVNqcNOq0Eq5StmCvUQbi3ZhXyEMBFxR6aRsqOOipKqhuoQxZrQwSphmC33MVqwvY_2TOgcGntdg8tqbvI4m30Ifop2Xt96O9Os73reNHvn-GBWvN2ij7wb7Fjhg37wLfeQ3k1Fibg
linkProvider Elsevier
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=On+optimization+formulations+for+radio+resource+allocation+subject+to+common+transmission+rate&rft.jtitle=Computers+%26+operations+research&rft.au=Zhao%2C+Yi&rft.au=Yuan%2C+Di&rft.date=2024&rft.issn=1873-765X&rft.volume=161&rft_id=info:doi/10.1016%2Fj.cor.2023.106427&rft.externalDocID=oai_DiVA_org_uu_515465
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon