Approximation algorithms for the robust facility leasing problem

DOI10.1007/s11590-018-1238-xzbMath1417.90102MaRDI QIDQ1749787

Lu Han, Min Li, Dongmei Zhang, Da-Chuan Xu

Publication date: 28 May 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1238-x

zbMATH Keywords

robust; approximation algorithm; primal-dual; facility leasing problem

Mathematics Subject Classification ID

90C10: Integer programming

90B80: Discrete location and assignment

Related Items

Approximation Algorithms for Matroid and Knapsack Means Problems, Approximation algorithms for prize-collecting capacitated network design problems, Continuous regularized least squares polynomial approximation on the sphere, On stochastic \(k\)-facility location

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• Offline and Online Facility Leasing
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Warehouse-Retailer Network Design Problem
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Local Search Heuristics for k-Median and Facility Location Problems
• Improved Combinatorial Algorithms for Facility Location Problems
• Stochastic Transportation-Inventory Network Design Problem
• Infrastructure Leasing Problems
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem