Approximate formulas of average distances associated with regions and their applications to location problems
From MaRDI portal
(Redirected from Publication:810364)
Recommendations
Cites work
Cited in
(12)- On the feasible set for the squared Euclidean Weber problem and applications
- Visualizing data as objects by DC (difference of convex) optimization
- Weber problems with mixed distances and regional demand
- An approximation for the \(k\)th nearest distance and its application to locational analysis
- The Weber problem with regional demand
- Assessing the efficiency of rapid transit configurations
- Some more average distance results
- Dealing with intraregional flows in spatial econometric gravity models
- On the structure of the solution set for the single facility location problem with average distances
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- Formulation of confidence intervals for estimated actual distances
- A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
This page was built for publication: Approximate formulas of average distances associated with regions and their applications to location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810364)
