A frequency assignment problem in cellular phone networks

A. Eisenblätter
{"title":"A frequency assignment problem in cellular phone networks","authors":"A. Eisenblätter","doi":"10.1090/dimacs/040/07","DOIUrl":null,"url":null,"abstract":"We present a mathematical formulation of a \\emph{frequency assignment problem} encountered in cellular phone networks: frequencies have to be assigned to stationary transceivers (carriers) such that as little interference as possible is induced while obeying several technical and legal restrictions. The optimization problem is NP-hard, and no good approximation can be guaranteed---unless P = NP. We sketch some starting and improvement heuristics, and report on their successful application for solving the frequency assignment problem under consideration. Computational results on real-world instances with up to 2877 carriers and 50 frequencies are presented.","PeriodicalId":115016,"journal":{"name":"Network Design: Connectivity and Facilities Location","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Network Design: Connectivity and Facilities Location","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/040/07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We present a mathematical formulation of a \emph{frequency assignment problem} encountered in cellular phone networks: frequencies have to be assigned to stationary transceivers (carriers) such that as little interference as possible is induced while obeying several technical and legal restrictions. The optimization problem is NP-hard, and no good approximation can be guaranteed---unless P = NP. We sketch some starting and improvement heuristics, and report on their successful application for solving the frequency assignment problem under consideration. Computational results on real-world instances with up to 2877 carriers and 50 frequencies are presented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
蜂窝电话网络中的频率分配问题
我们提出了蜂窝电话网络中遇到的\emph{频率分配问题}的数学公式:频率必须分配给固定收发器(运营商),以便在遵守若干技术和法律限制的同时尽可能少地引起干扰。优化问题是NP困难的,没有好的近似可以保证——除非P = NP。我们概述了一些启发式的开始和改进,并报告了它们在解决所考虑的频率分配问题上的成功应用。在实际实例中给出了多达2877个载波和50个频率的计算结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A frequency assignment problem in cellular phone networks Network improvement problems An optimal greedy algorithm for wavelength allocation in directed tree networks Shortest networks on spheres Reducing the graphical Steiner problem with a sensitivity test
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1