Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty

DOI10.1287/opre.29.6.1219zbMath0474.90035OpenAlexW2056722395MaRDI QIDQ3929367

Henrik Juel

Publication date: 1981

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.29.6.1219

zbMATH Keywords

numerical examplescomputation of boundsgeneralized Weber problemarbitrary measures of distancelocational uncertainty

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (9)

On duality in the vectorial control-approximation problem ⋮ Unnamed Item ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ The \(p\)-median problem under uncertainty ⋮ On the feasible set for the squared Euclidean Weber problem and applications ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ The stochastic \(p\)-median problem with unknown cost probability distribution ⋮ The Weber problem with regional demand

This page was built for publication: Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty