An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
From MaRDI portal
Publication:384185
DOI10.1007/s40305-013-0020-0zbMath1281.90043OpenAlexW2148142671MaRDI QIDQ384185
Publication date: 27 November 2013
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-013-0020-0
Related Items
Strategyproof facility location with limited locations ⋮ Approximation algorithm for squared metric two-stage stochastic facility location problem ⋮ An approximation algorithm for the uniform capacitated \(k\)-means problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Approximation Algorithms for Metric Facility Location Problems
- 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
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
