A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem

Author:

Bumb Adriana,Kern Walter

Publisher

Springer Berlin Heidelberg

Reference7 articles.

1. Aardal, K.I., Chudak, F., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters, 72, (1999), 161–167

2. Cornuejols, G., Nemhauser, G. L., Wolsey, L. A.: The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, John Wiley and Sons, New York, (1990), 119–171

3. Guha, S., Khuller, S.: Greedy strikes back: improved facility algorithms. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, (1998), 649–657

4. Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k-median problems. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, (1999)

5. Meyerson, A., Munagala, K., Plotkin S.: Cost distance: Two metric network design. Proceedings of the 41th IEEE Symposium on Foundation of Computer Science, (2000)

Cited by 25 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Cost-Sharing Scheme for the k-Level Facility Location Game with Penalties;Journal of the Operations Research Society of China;2021-06-01

2. An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network;Communications in Computer and Information Science;2021

3. An approximation algorithm for stochastic multi-level facility location problem with soft capacities;Journal of Combinatorial Optimization;2020-02-11

4. An Approximation Algorithm for the Dynamic k-level Facility Location Problem;Algorithmic Aspects in Information and Management;2019

5. Inter and Intra Cities Smartness;Environmental Information Systems;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3