Sensitivity analysis of the optimal location of a facility
From MaRDI portal
Publication:3701166
DOI10.1002/nav.3800320203zbMath0578.90022OpenAlexW2010270969MaRDI QIDQ3701166
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
sensitivity analysisWeber problemconditions of uncertaintyoptimal siteEuclidean, single-facility minisum problem
Related Items
Efficient algorithms for the minmax regret path center problem with length constraint on trees, On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, An improved algorithm for the minmax regret path centdian problem on trees, An improved algorithm for the minmax regret path center problem on trees, Asymptotic behavior of the Weber location problem on the plane, The \(p\)-median problem under uncertainty, Spatial point process models for location-allocation problems, On the feasible set for the squared Euclidean Weber problem and applications, The stochastic \(p\)-median problem with unknown cost probability distribution, Algorithms for the robust 1-center problem on a tree, The Weber problem with regional demand, On the minmax regret path median problem on trees
Cites Work
