The single facility location problem with average-distances
From MaRDI portal
Publication:1024705
DOI10.1007/s11750-008-0040-9zbMath1162.90500OpenAlexW2045149087MaRDI QIDQ1024705
I. Espejo Miranda, Antonio M. Rodríguez-Chía, C. Valero-Franco
Publication date: 17 June 2009
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-008-0040-9
Related Items (5)
Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ On the structure of the solution set for the single facility location problem with average distances
Cites Work
- Unnamed Item
- Unnamed Item
- Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
- The Weber problem with regional demand
- Location of a moving service facility
- New models for locating a moving service facility
- Location of regional facilities
- Mathematical Models of Road Travel Distances
- Optimal location of a facility relative to area demands
- A New Distance Function for Modeling Travel Distances in a Transportation Network
- ON THE LAMÉ POINT AND ITS GENERALIZATIONS IN A NORMED SPACE
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- The generalized Weber problem with expected distances
- An Approach to Location Models Involving Sets as Existing Facilities
- Optimal location of a single facility with circular demand areas
- Locating facilities by minimax relative to closest points of demand areas
This page was built for publication: The single facility location problem with average-distances
