Weber problems with mixed distances and regional demand
From MaRDI portal
Publication:2465384
DOI10.1007/S00186-007-0165-XzbMath1146.90464OpenAlexW2047020160WikidataQ104129303 ScholiaQ104129303MaRDI QIDQ2465384
Publication date: 4 January 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-007-0165-x
Continuous location (90B85) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15)
Related Items (7)
Continuous location of an assembly station ⋮ Weber problems with high-speed lines ⋮ Algorithms for location problems based on angular distances ⋮ Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538] ⋮ Simultaneous location of a service facility and a rapid transit line ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate formulas of average distances associated with regions and their applications to location problems
- Weber problems with alternative transportation systems
- The Weber problem with regional demand
- A linearization method for mixed 0--1 polynomial programs
- A characterization of efficient points in constrained location problems with regional demand
- A Mass Transportation Model for the Optimal Planning of an Urban Region
- On the Continuous Fermat-Weber Problem
- Location Theory, Dominance, and Convexity
- BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
This page was built for publication: Weber problems with mixed distances and regional demand
