An approximation algorithm for the dynamic facility location problem with outliers
From MaRDI portal
Publication:2421446
DOI10.1007/s11590-017-1153-6zbMath1423.90131OpenAlexW2374053826MaRDI QIDQ2421446
Dongmei Zhang, Yanjun Jiang, Da-Chuan Xu, Dong-lei Du
Publication date: 17 June 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1153-6
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- A new approximation algorithm for the \(k\)-facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A Dual-Based Procedure for Dynamic Facility Location
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
This page was built for publication: An approximation algorithm for the dynamic facility location problem with outliers
