A single facility stochastic location problem under A-distance

DOI10.1007/BF02204864zbMath0732.90055OpenAlexW1990338793MaRDI QIDQ809889

Shôgo Shiode, Hiroaki Ishii

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1007/bf02204864

zbMATH Keywords

chance constrained programmingrectilinear distanceA-distancestochastic facility location

Mathematics Subject Classification ID

Continuous location (90B85) Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

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

This page was built for publication: A single facility stochastic location problem under A-distance