Mathematical Models of Road Travel Distances
From MaRDI portal
Cited in
(42)- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Convex ordered median problem with \(\ell _p\)-norms
- The single facility location problem with average-distances
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Estimating road distances by mathematical functions
- Duality in constrained location problems
- Vehicle routing considerations in distribution system design
- The impact of distance on location problems
- Locational analysis
- Parametric distance functions vs. nonparametric neural networks for estimating road travel distances
- A maximum \(L_p\) distance problem
- Estimation and determination of shortest path length in a road network with obstacles
- A note on convergence in the single facility minisum location problem
- A generalization of the rectangular bounding method for continuous location models
- A variational inequality approach for constrained multifacility Weber problem under gauge
- Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
- Local convexity results in a generalized Fermat-Weber problem
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- ADMM-type methods for generalized multi-facility Weber problem
- Workforce planning for O2O delivery systems with crowdsourced drivers
- Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- Directional bias of the \(l_ p\)-norm
- Government preparedness: using simulation to prepare for a terrorist attack
- Vehicle routing on road networks: how good is Euclidean approximation?
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- A generalized Weber problem with different gauges for different regions
- On an extension of Weber problem with Euclidean distance
- Algorithms for location problems based on angular distances
- Multicriteria decision making under uncertainty: a visual approach
- Continuous location model of a rectangular barrier facility
- Voronoi diagrams and their uses
- On the directional bias of the \(\ell_{bp}\)-norm
- Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- A generalized k-means problem for clustering and an ADMM-based k-means algorithm
- Local convergence in a generalized Fermat-Weber problem
- Probabilistic \(l_ p\) distances in location models
- Demand sensitivity to space-price competition with Manhattan and Euclidean representations of distance
- The general optimal market area model
- Determination of efficient solutions for point-objective locational decision problems
This page was built for publication: Mathematical Models of Road Travel Distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853432)
