A single facility stochastic location problem under A-distance
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3876892 (Why is no real title available?)
- scientific article; zbMATH DE number 3934726 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- On Some Distance Problems in Fixed Orientations
- Probabilistic Weights in the One-Dimensional Facility Location Problem
- Probabilistic formulations of the multifacility weber problem
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- The Expected Value of Perfect Information in Facility Location
- Using Block Norms for Location Modeling
Cited in
(10)- On the feasible set for the squared Euclidean Weber problem and applications
- A competitive facility location problem on a tree network with stochastic weights.
- Stochastic facility location with general long-run costs and convex short-run costs
- Stochastic Facility Construction Problem with Preference of Candidate Sites
- A Dual-Based Procedure for Stochastic Facility Location
- On stochastic \(k\)-facility location
- scientific article; zbMATH DE number 4035532 (Why is no real title available?)
- Degree of locational freedom in a single facility euclidean minimax location model
- Location models with stochastic demand points
- Stochastic problem of competitive location of facilities with quantile criterion
This page was built for publication: A single facility stochastic location problem under A-distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809889)