Weber problems with alternative transportation systems
From MaRDI portal
Publication:1278584
DOI10.1016/S0377-2217(96)00066-5zbMath0923.90111OpenAlexW2038173254MaRDI QIDQ1278584
Emilio Carrizosa, Antonio M. Rodríguez-Chía
Publication date: 11 April 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(96)00066-5
continuous location\(p\)-mediangauge(multi)-Weber problemsplanar \(p\)-facility locationtotal transportation cost
Related Items (17)
New formulations for the uncapacitated multiple allocation hub location problem ⋮ A unified model for Weber problems with continuous and network distances ⋮ Continuous location of an assembly station ⋮ Weber problems with high-speed lines ⋮ Gate points in continuous location between regions with different \(\ell _{p}\) norms ⋮ Linear separation and approximation by minimizing the sum of concave functions of distances ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ The 1-Center and 1-Highway Problem ⋮ Fixed gate point location problems ⋮ Weber problems with mixed distances and regional demand ⋮ Continuous location under the effect of `refraction' ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line ⋮ 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 ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Localization in single facility location
- Geometrical properties of the Fermat-Weber problem
- Sets of efficient points in a normed space
- Mixed planar/network facility location problems
- GBSSS: The generalized big square small square method for planar single- facility location
- An optimal method for solving the (generalized) multi-Weber problem
- Approximation of solutions for location problems
- Using Block Norms for Location Modeling
- The Minisum and Minimax Location Problems Revisited
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
This page was built for publication: Weber problems with alternative transportation systems
