Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-38236-9_12
Reference14 articles.
1. Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. European Journal of Operational Research 123(2), 292–302 (2000)
2. Lecture Notes in Computer Science;B. Bhattacharya,2012
3. Brodal, G.S., Georgiadis, L., Katriel, I.: An O(n logn) version of the Averbakh-Berman algorithm for the robust median of a tree. Operations Research Letters 36(1), 14–18 (2008)
4. Chen, D., Chen, R.: A relaxation-based algorithm for solving the conditional p-center problem. Operations Research Letters 38(3), 215–217 (2010)
5. Chen, B., Lin, C.: Minmax-regret robust 1-median location on a tree. Networks 31(2), 93–103 (1998)
Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A 3D Predictive Method for Deep-Seated Gold Deposits in the Northwest Jiaodong Peninsula and Predicted Results of Main Metallogenic Belts;Minerals;2022-07-25
2. Minmax regret for sink location on dynamic flow paths with general capacities;Discrete Applied Mathematics;2022-07
3. Multiple sink location problem in path networks with a combinational objective;Optimization Letters;2020-05-18
4. Minsum k-sink problem on path networks;Theoretical Computer Science;2020-02
5. A Survey on Facility Location Problems in Dynamic Flow Networks;The Review of Socionetwork Strategies;2019-09-04
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3