On the power of static assignment policies for robust facility location problems
From MaRDI portal
Publication:2061885
DOI10.1007/978-3-030-73879-2_18zbMath1483.90071arXiv2011.04925OpenAlexW3165225981MaRDI QIDQ2061885
Omar El Housni, Vineet Goyal, David B. Shmoys
Publication date: 21 December 2021
Full work available at URL: https://arxiv.org/abs/2011.04925
Discrete location and assignment (90B80) Approximation algorithms (68W25) Robustness in mathematical programming (90C17)
Related Items (2)
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization ⋮ On the power of static assignment policies for robust facility location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thresholded covering algorithms for robust and max-min optimization
- Two-stage robust network design with exponential scenarios
- Distributionally robust facility location problem under decision-dependent stochastic demand
- On the power of static assignment policies for robust facility location problems
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Boosted sampling
- Greedy Strikes Back: Improved Facility Location Algorithms
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
- Robust Combinatorial Optimization with Exponential Scenarios
- Integer Programming and Combinatorial Optimization
This page was built for publication: On the power of static assignment policies for robust facility location problems
