An Improved Optimal Algorithm for a Location Choice Problem

Ma Ran, Han Xuefeng
{"title":"An Improved Optimal Algorithm for a Location Choice Problem","authors":"Ma Ran, Han Xuefeng","doi":"10.1109/ICNDS.2009.95","DOIUrl":null,"url":null,"abstract":"The paper presents an improved optimal location choice in a network. The location choice model considers not only the maximum distances between the vertices but also the sum of the whole cost, which is a common problem in our society.","PeriodicalId":154117,"journal":{"name":"2009 International Conference on Networking and Digital Society","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Networking and Digital Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNDS.2009.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The paper presents an improved optimal location choice in a network. The location choice model considers not only the maximum distances between the vertices but also the sum of the whole cost, which is a common problem in our society.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
位置选择问题的改进最优算法
提出了一种改进的网络最优位置选择方法。区位选择模型不仅要考虑点间的最大距离,而且要考虑总成本的总和,这是社会上普遍存在的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Non-transitive Bidirectional Proxy Re-encryption Scheme Application of Digital Technology in Open and Distance Education PDM-Based Product Design Knowledge Integration Assessment of Network Teaching Resources Based on Fuzzy Synthesize Evaluation The P2P Network Resources Localization Algorithm Research and Improvement Based on JXTA Platform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1