Greedy algorithms for the single-demand facility location problem

被引：6
|
作者：
Cheung, Sin-Shuen [1 ]
Williamson, David P. [1 ]
机构：
[1] Cornell Univ, Sch Operat Res & Informat Engn, Ithaca, NY 14853 USA
来源：
OPERATIONS RESEARCH LETTERS | 2017年 / 45卷 / 05期
关键词：
Facility location; Approximation algorithm; Greedy algorithm;
D O I：
10.1016/j.orl.2017.07.002
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this note, we give greedy approximation algorithms for the single-demand facility location problem inspired by the greedy algorithms for the min-knapsack problem originally given by Gens and Levner (1979) and later analyzed by Csirik et al. (1991). The simplest algorithm is a 2-approximation algorithm running in O(n log n) time; in general, we give a k+1/k-approximation algorithm running in O(n(k) log n) time. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：452 / 455
页数：4
相关论文
共 50 条
  • [1] Algorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Servers
    Qian Wang
    Rajan Batta
    Christopher M. Rump
    [J]. Annals of Operations Research, 2002, 111 : 17 - 34
  • [2] Algorithms for a facility location problem with Stochastic customer demand and immobile servers
    Wang, Q
    Batta, R
    Rump, CM
    [J]. ANNALS OF OPERATIONS RESEARCH, 2002, 111 (1-4) : 17 - 34
  • [3] On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
    Flaxman, Abraham D.
    Frieze, Alan M.
    Vera, Juan Carlos
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (05): : 713 - 732
  • [4] Greedy strikes back: Improved facility location algorithms
    Guha, S
    Khuller, S
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1999, 31 (01): : 228 - 248
  • [5] THE SINGLE FACILITY MINIMAX DISTANCE PROBLEM UNDER STOCHASTIC LOCATION OF DEMAND
    CARBONE, R
    MEHREZ, A
    [J]. MANAGEMENT SCIENCE, 1980, 26 (01) : 113 - 115
  • [6] RAMP algorithms for the capacitated facility location problem
    Telmo Matos
    Óscar Oliveira
    Dorabela Gamboa
    [J]. Annals of Mathematics and Artificial Intelligence, 2021, 89 : 799 - 813
  • [7] RAMP algorithms for the capacitated facility location problem
    Matos, Telmo
    Oliveira, Oscar
    Gamboa, Dorabela
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2021, 89 (8-9) : 799 - 813
  • [8] Approximate algorithms for the competitive facility location problem
    Beresnev V.L.
    Mel'nikov A.A.
    [J]. Journal of Applied and Industrial Mathematics, 2011, 5 (2) : 180 - 190
  • [9] Approximation Algorithms for the Priority Facility Location Problem with Penalties
    WANG Fengmin
    XU Dachuan
    WU Chenchen
    [J]. Journal of Systems Science & Complexity, 2015, 28 (05) : 1102 - 1114
  • [10] Incremental Facility Location Problem and Its Competitive Algorithms
    Dai, Wenqiang
    Zeng, Xianju
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (03) : 307 - 320
12345