Data-driven distributionally robust capacitated facility location problem
From MaRDI portal
Publication:2030664
DOI10.1016/j.ejor.2020.09.026zbMath1487.90446OpenAlexW3090284272WikidataQ115162903 ScholiaQ115162903MaRDI QIDQ2030664
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.026
Stochastic programming (90C15) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)
Related Items
Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution ⋮ Robust Team Orienteering Problem with Decreasing Profits ⋮ Approximation algorithm for min-max correlation clustering problem with outliers ⋮ The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems ⋮ Distributionally robust facility location with bimodal random demand ⋮ Robust recycling facility location with clustering ⋮ An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers ⋮ Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity ⋮ Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning ⋮ Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times ⋮ Data-driven robust optimization using deep neural networks ⋮ A data-driven distributionally robust approach for the optimal coupling of interdependent critical infrastructures under random failures ⋮ Mitigating the COVID‐19 pandemic through data‐driven resource sharing ⋮ Wasserstein distributionally robust chance-constrained program with moment information ⋮ A distributionally robust chance-constrained model for humanitarian relief network design ⋮ Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems ⋮ A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- An exact algorithm for the capacitated facility location problems with single sourcing
- Location science research: a review
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Strategic facility location: A review
- A framework for optimization under ambiguity
- DC programming: overview.
- Robust strategies for facility location under uncertainty
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Robustifying Convex Risk Measures for Linear Portfolios: A Nonparametric Approach
- Distributionally Robust Convex Optimization
- An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- Stability Of Solutions To The P-Median Problem Under Induced Data Error
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- An Improved Algorithm for the Capacitated Facility Location Problem
- α-Reliable p-minimax regret: A new model for strategic facility location modeling
- Exact Solution to a Location Problem with Stochastic Demands
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Wasserstein Distance and the Distributionally Robust TSP
- Column Generation
