Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
From MaRDI portal
Publication:279517
DOI10.1016/j.amc.2014.05.052zbMath1334.90066OpenAlexW2003645818MaRDI QIDQ279517
Publication date: 28 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.05.052
semidefinite programmingrobust optimizationWeber problemblock normssecond-order cone programmingmulti-facility
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust solutions to Euclidean facility location problems with uncertain data
- Robust solutions of uncertain linear programs
- Topics in semidefinite and interior-point methods
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust optimization-methodology and applications
- On robust solutions to linear least squares problems affected by data uncertainty and implementation errors with application to stochastic signal modeling
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Encyclopedia of Optimization
- Using Block Norms for Location Modeling
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Robust Truss Topology Design via Semidefinite Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
