Approximation algorithms for the robust facility leasing problem

DOI10.1007/S11590-018-1238-XMaRDI QIDQ1749787zbMATH OpenOpenAlexFDO

Authors Lu Han, M. Li, Dongmei Zhang, Dachuan 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

approximation algorithmfacility leasing problemprimal-dualrobust

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• Offline and Online Facility Leasing
• Offline and online facility leasing
• Approximation Algorithms for the Robust Facility Location Problem with Penalties
• Combinatorial approximation algorithms for the robust facility location problem with penalties
• Improved approximation algorithms for the robust fault-tolerant facility location problem

Cites work

• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Algorithms for facility location problems with outliers. (Extended abstract)
• An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• Greedy Strikes Back: Improved Facility Location Algorithms
• scientific article; zbMATH DE number 1947060 (Why is no real title available?)
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• scientific article; zbMATH DE number 2086926 (Why is no real title available?)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Improved Combinatorial Algorithms for Facility Location Problems
• Infrastructure Leasing Problems
• Local Search Heuristics for k-Median and Facility Location Problems
• Offline and Online Facility Leasing
• Stochastic Transportation-Inventory Network Design Problem
• Warehouse-Retailer Network Design Problem

Cited in

(7)

• Continuous regularized least squares polynomial approximation on the sphere
• On stochastic k-facility location
• Towards Flexible Demands in Online Leasing Problems
• scientific article; zbMATH DE number 2165196 (Why is no real title available?)
• Approximation Algorithms for Matroid and Knapsack Means Problems
• Approximation algorithms for prize-collecting capacitated network design problems
• Application of a distributionally robust optimization approach for single-period stochastic inventory problems with different carbon policies

This page was built for publication: Approximation algorithms for the robust facility leasing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749787)