Sensitivity analysis of the optimal location of a facility
From MaRDI portal
Publication:3701166
DOI10.1002/NAV.3800320203zbMATH Open0578.90022OpenAlexW2010270969MaRDI QIDQ3701166FDOQ3701166
Publication date: 1985
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800320203
Recommendations
sensitivity analysisWeber problemconditions of uncertaintyoptimal siteEuclidean, single-facility minisum problem
Cites Work
Cited In (15)
- On the minmax regret path median problem on trees
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- Spatial point process models for location-allocation problems
- Parametric analysis of optimal facility locations
- An improved algorithm for the minmax regret path center problem on trees
- Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem
- Algorithms for the robust 1-center problem on a tree
- The stochastic \(p\)-median problem with unknown cost probability distribution
- Asymptotic behavior of the Weber location problem on the plane
- On the feasible set for the squared Euclidean Weber problem and applications
- Application of decision analysis techniques to the Weber facility location problem
- The Weber problem with regional demand
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- The \(p\)-median problem under uncertainty
- An improved algorithm for the minmax regret path centdian problem on trees
This page was built for publication: Sensitivity analysis of the optimal location of a facility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701166)