A single facility stochastic location problem under A-distance
From MaRDI portal
Publication:809889
DOI10.1007/BF02204864zbMath0732.90055MaRDI QIDQ809889
Publication date: 1991
Published in: Annals of Operations Research (Search for Journal in Brave)
90B85: Continuous location
90C15: Stochastic programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
On the feasible set for the squared Euclidean Weber problem and applications, A competitive facility location problem on a tree network with stochastic weights.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Some Distance Problems in Fixed Orientations
- Using Block Norms for Location Modeling
- The Expected Value of Perfect Information in Facility Location
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Probabilistic Weights in the One-Dimensional Facility Location Problem
- Probabilistic formulations of the multifacility weber problem