On the feasible set for the squared Euclidean Weber problem and applications

DOI10.1016/S0377-2217(98)00316-6zbMath0933.90043OpenAlexW2093458226MaRDI QIDQ1806622

Carlton H. Scott, Zvi Drezner

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00316-6

zbMATH Keywords

sensitivityWeber location problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• A single facility stochastic location problem under A-distance
• Approximate formulas of average distances associated with regions and their applications to location problems
• Optimum positioning of moving service facility
• The impact of distance on location problems
• The Weber problem with regional demand
• Application of decision analysis techniques to the Weber facility location problem
• Bounds on the Optimal Location to the Weber Problem under Conditions of Uncertainty
• Sensitivity analysis of the optimal location of a facility
• Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
• Probabilistic Weights in the One-Dimensional Facility Location Problem
• The generalized Weber problem with expected distances
• Programming with linear fractional functionals

This page was built for publication: On the feasible set for the squared Euclidean Weber problem and applications