Mathematical Models of Road Travel Distances

From MaRDI portal
Revision as of 17:29, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3853432

DOI10.1287/mnsc.25.2.130zbMath0419.90053OpenAlexW2123565436MaRDI QIDQ3853432

James G. Morris, Love, Robert F.

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.2.130




Related Items (41)

A generalized Weber problem with different gauges for different regionsDirectional bias of the \(l_ p\)-normOn an extension of Weber problem with Euclidean distanceDuality in constrained location problemsVehicle routing considerations in distribution system designA maximum \(L_p\) distance problemVehicle routing on road networks: how good is Euclidean approximation?Estimation and determination of shortest path length in a road network with obstaclesA Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive FacilitiesCustomized alternating direction methods of multipliers for generalized multi-facility Weber problemThe impact of distance on location problemsWorkforce planning for O2O delivery systems with crowdsourced driversOn the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)The general optimal market area modelDetermination of efficient solutions for point-objective locational decision problemsA variational inequality approach for constrained multifacility Weber problem under gaugeLocational analysisAlgorithms for location problems based on angular distancesGovernment preparedness: using simulation to prepare for a terrorist attackSingle-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight lineLocal convergence in a generalized Fermat-Weber problemProbabilistic \(l_ p\) distances in location modelsDemand sensitivity to space-price competition with Manhattan and Euclidean representations of distanceOn the directional bias of the \(\ell_{bp}\)-normContinuous location model of a rectangular barrier facilityLocation of a semi-obnoxious facility with elliptic maximin and network minisum objectivesMulticriteria decision making under uncertainty: a visual approachEstimating 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 setLocal convexity results in a generalized Fermat-Weber problemDiscrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locationsConvex ordered median problem with \(\ell _p\)-normsParametric distance functions vs. nonparametric neural networks for estimating road travel distancesAn ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gaugeThe single facility location problem with average-distancesA heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approachADMM-type methods for generalized multi-facility Weber problemA location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locationsVoronoi Diagrams and Their UsesEstimating road distances by mathematical functionsA note on convergence in the single facility minisum location problemA generalization of the rectangular bounding method for continuous location models







This page was built for publication: Mathematical Models of Road Travel Distances