Distributionally robust Weber problem with uncertain demand
From MaRDI portal
Recommendations
- A distributionally robust optimization approach for two-stage facility location problems
- Data-driven distributionally robust capacitated facility location problem
- Robust facility location
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
- Robust strategies for facility location under uncertainty
Cites work
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A heuristic method for large-scale multi-facility location problems
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
- A Survey of the S-Lemma
- Acceleration on adaptive importance sampling with sample average approximation
- Ambiguous chance constrained problems and robust optimization
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- Convex Analysis
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Equilibrium problems: nonsmooth optimization and variational inequality models
- Expected residual minimization method for stochastic variational inequality problems
- Expected Value of Distribution Information for the Newsvendor Problem
- Frameworks and results in distributionally robust optimization
- scientific article; zbMATH DE number 3130649 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- Link-Length Minimization in Networks
- Minmax regret maximal covering location problems with edge demands
- On duality theory of conic linear problems.
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers
- Probabilistic methods for algorithmic discrete mathematics
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- Robust optimization
- Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances
- Sample average approximation method for chance constrained programming: Theory and applications
- Stochastic variational inequalities: residual minimization smoothing sample average approximations
- The minimax approach to stochastic programming and an illustrative application
- The Price of Robustness
- The sample average approximation method applied to stochastic routing problems: a computational study
- Using Block Norms for Location Modeling
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
This page was built for publication: Distributionally robust Weber problem with uncertain demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175466)
