The Weber problem with regional demand

DOI10.1016/S0377-2217(97)00190-2MaRDI QIDQ1291661zbMATH OpenOpenAlexFDO

Authors Emilio Carrizosa, Justo Puerto, M. Muñoz-Márquez

Publication date 22 February 2001

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

Full work available at URL https://doi.org/10.1016/s0377-2217(97)00190-2, https://idus.us.es/handle//11441/107819

zbMATH Keywords

average distanceslocationWeber problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• The generalized Weber problem with expected distances
• scientific article; zbMATH DE number 1803754
• The Weber problem in congested regions with entry and exit points
• On an extension of Weber problem with Euclidean distance
• An algorithm for Weber's problem on the sphere

Cites work

• A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
• Approximate formulas of average distances associated with regions and their applications to location problems
• Generalized Weber Problem with Rectangular Regions
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Location of facilities with rectangular distances among point and area destinations
• Location of regional facilities
• Optimal location of a facility relative to area demands
• Sensitivity analysis of the optimal location of a facility
• Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
• The generalized Weber problem with expected distances

Cited in

(26)

• The single facility location problem with average-distances
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• Visualizing data as objects by DC (difference of convex) optimization
• On the feasible set for the squared Euclidean Weber problem and applications
• A continuous approximation approach for the integrated facility-inventory allocation problem
• A branch-and-price approach for the continuous multifacility monotone ordered median problem
• Single facility siting involving allocation decisions
• A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
• Weber problems with mixed distances and regional demand
• A minisum location problem with regional demand considering farthest Euclidean distances
• Heuristics for a continuous multi-facility location problem with demand regions
• On an extension of Weber problem with Euclidean distance
• A projected Weiszfeld algorithm for the box-constrained Weber location problem
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• On the structure of the solution set for the single facility location problem with average distances
• Locating facilities by minimax relative to closest points of demand areas
• A new algorithm for the minimax location problem with the closest distance
• The geometry of optimal partitions in location problems
• Reviewing extensions and solution methods of the planar Weber single facility location problem
• The Weber problem with demand uniformly generated in discs
• Counterfactual explanations with the k-nearest neighborhood classifier and uncertain data
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• Minisum location problem with farthest Euclidean distances
• The maximin line problem with regional demand

This page was built for publication: The Weber problem with regional demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291661)