The Weber problem with regional demand
From MaRDI portal
Publication:1291661
DOI10.1016/S0377-2217(97)00190-2zbMath0955.90063OpenAlexW2051956682MaRDI QIDQ1291661
Emilio Carrizosa, Justo Puerto, Manuel Munoz-Marquez
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
Related Items (22)
On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre ⋮ Heuristics for a continuous multi-facility location problem with demand regions ⋮ Minisum location problem with farthest Euclidean distances ⋮ The maximin line problem with regional demand ⋮ Single facility siting involving allocation decisions ⋮ A continuous approximation approach for the integrated facility-inventory allocation problem ⋮ A new algorithm for the minimax location problem with the closest 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 ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Weber problems with mixed distances and regional demand ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ The geometry of optimal partitions in location problems ⋮ 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 continuous analysis framework for the solution of location-allocation problems with dense demand ⋮ On the feasible set for the squared Euclidean Weber problem and applications ⋮ A minisum location problem with regional demand considering farthest Euclidean distances ⋮ The single facility location problem with average-distances ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate formulas of average distances associated with regions and their applications to location problems
- Sensitivity analysis of the optimal location of a facility
- Location of regional facilities
- Optimal location of a facility relative to area demands
- Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
- Generalized Weber Problem with Rectangular Regions
- The generalized Weber problem with expected distances
- Location of facilities with rectangular distances among point and area destinations
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
This page was built for publication: The Weber problem with regional demand
