Combinatorial approximation algorithms for the robust facility location problem with penalties
From MaRDI portal
Publication:280977
DOI10.1007/s10898-014-0251-6zbMath1343.90049OpenAlexW1979118400MaRDI QIDQ280977
Fengmin Wang, Chen-Chen Wu, Da-Chuan Xu
Publication date: 10 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0251-6
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ A utility theory based interactive approach to robustness in linear optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- LP-based approximation algorithms for capacitated facility location
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- Improved approximation algorithms for capacitated facility location problems
- A new approximation algorithm for the \(k\)-facility location problem
- A cross-monotonic cost-sharing scheme for the concave facility location game
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- The \(k\)-level facility location game
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- The Design of Approximation Algorithms
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Integrating facility location and production planning decisions
- Robust Fault Tolerant uncapacitated facility location
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A 3-Approximation for Facility Location with Uniform Capacities
- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
- Greedy Strikes Back: Improved Facility Location Algorithms
- The facility location problem with general cost functions
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
- Improved Combinatorial Algorithms for Facility Location Problems
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Algorithms - ESA 2003
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Combinatorial approximation algorithms for the robust facility location problem with penalties
