Improved local search for universal facility location

详细信息    查看全文

• 作者：Eric Angel (1)
  Nguyen Kim Thang (1)
  Damien Regnault (1)
  
  1. IBISC ; University of Evry Val d鈥橢ssonne ; Evry ; France
  
• 刊名：Journal of Combinatorial Optimization
• 出版年：2015
• 出版时间：January 2015
• 年：2015
• 卷：29
• 期：1
• 页码：237-246
• 全文大小：193 KB
• 参考文献：1. Aggarwal A, Louis A, Bansal M, Garg N, Gupta N, Gupta S, and Jain S (2010) A 3-approximation for facility location with uniform capacities. In: Proceedings 14th conference on integer programming and combinatorial cptimization (IPCO), pp 149鈥?62
  2. Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for \(k\) -median and facility location problems. SIAM J Comput 33(3):544鈥?62 CrossRef
  3. Bansal M, Garg N, Gupta N (2012) A 5-approximation for capacitated facility location. In: Proceedings 20th European symposium on algorithms (ESA), pp 133鈥?44
  4. Garg N, Khandekar R, Pandit V (2005) Improved approximation for universal facility location. In: Proceedings 16th symposium on discrete algorithms, pp 959鈥?60
  5. Hajiaghayi MT, Mahdian M, Mirrokni VS (2003) The facility location problem with general cost functions. Networks 42(1):42鈥?7 CrossRef
  6. Li J, Khuller S (2011) Generalized machine activation problems. In: Proceedings of the twenty-second Annual ACM-SIAM symposium on discrete algorithms (SODA), pp 80鈥?4
  7. Mahdian M, P谩l M (2003) Universal facility location. In: Proceedings 11th Annual European symposium on algorithms (ESA), pp 409鈥?21
  8. P谩l M, Tardos 脡, Wexler T (2001) Facility location with nonuniform hard capacities. In: Proceedings 42nd annual symposium on foundations of computer science, pp 329鈥?38
  9. Vygen J (2007) From stars to comets: improved local search for universal facility location. Oper Res Lett 35(4):427鈥?33 CrossRef
  10. Zhang J, Chen B, Ye Y (2005) A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res 30(2):389鈥?03 CrossRef
  
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Combinatorics
  Convex and Discrete Geometry
  Mathematical Modeling and IndustrialMathematics
  Theory of Computation
  Optimization
  Operation Research and Decision Theory
  
• 出版者：Springer Netherlands
• ISSN：1573-2886

文摘

We consider the universal facility location problem in which the goal is to assign clients to facilities in order to minimize the sum of connection and facility costs. The connection cost is proportional to the distance each client has to travel to its assigned facility, whereas the cost of a facility is a non-decreasing function depending on the number of clients assigned to the facility. This model generalizes several variants of facility location problems. We present a \((5.83 + \epsilon )\) approximation algorithm for this problem based on local search technique.