Facilities location
RF Love, JG Morris, GO Wesolowsky - 1988 - imm.dtu.dk
1. Show that the level sets are convex sets 2. If all level sets are convex, is the function
convex? 3. Show that the minimizers of f form a convex set 4. Show that f (x− a) is a convex …
convex? 3. Show that the minimizers of f form a convex set 4. Show that f (x− a) is a convex …
Mathematical models of road travel distances
RF Love, JG Morris - Management Science, 1979 - pubsonline.informs.org
Some management science models require estimates of distances between points in a road
network based on the point coordinates. This paper evaluates the accuracy of a range of …
network based on the point coordinates. This paper evaluates the accuracy of a range of …
Modelling inter-city road distances by mathematical functions
RF Love, JG Morris - Journal of the Operational Research Society, 1972 - Springer
This study describes an analysis of seven distance functions with reference to their ability to
estimate road distances between cities. The optimal parameters of each function are …
estimate road distances between cities. The optimal parameters of each function are …
Global convergence of a generalized iterative procedure for the minisum location problem with lp distances
J Brimberg, RF Love - Operations Research, 1993 - pubsonline.informs.org
This paper considers a general form of the single facility minisum location problem (also
referred to as the Fermat-Weber problem), where distances are measured by an l p norm. An …
referred to as the Fermat-Weber problem), where distances are measured by an l p norm. An …
Location of facilities with rectangular distances among point and area destinations
GO Wesolowsky, RF Love - Naval Research Logistics Quarterly, 1971 - Wiley Online Library
This article is concerned with the optimal location of any number (n) of facilities in relation to
any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the …
any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the …
Properties and solution methods for large location—allocation problems
RF Love, H Juel - Journal of the Operational Research Society, 1982 - Taylor & Francis
… with p > 1, such as those discussed in Love,8 our experience has shown that the allocations
… 8 RF LovE (1974) The dual of a hyperbolic approximation to the generalized constrained …
… 8 RF LovE (1974) The dual of a hyperbolic approximation to the generalized constrained …
A computation procedure for the exact solution of location‐allocation problems with rectangular distances
RF Love, JG Morris - Naval Research Logistics Quarterly, 1975 - Wiley Online Library
… When the values of the wij are known, solution methods for location problems having
Euclidean distances are discussed by Love and Kraemer [16]. Network location solution methods …
Euclidean distances are discussed by Love and Kraemer [16]. Network location solution methods …
A computational procedure for optimally locating a facility with respect to several rectangular regions
RF Love - Journal of Regional Science, 1972 - Wiley Online Library
… A solution algorithm has been developed by Wesolowsky and Love [26] for locating one
facility in relation to any number of points and rectangular areas when the given distances are …
facility in relation to any number of points and rectangular areas when the given distances are …
Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
RF Love - Management Science, 1976 - pubsonline.informs.org
A dynamic programming algorithm is presented to locate m variable facilities in relation to n
existing facilities situated on one route. Each of the n existing facilities has a requirement …
existing facilities situated on one route. Each of the n existing facilities has a requirement …
A nonlinear approximation method for solving a generalized rectangular distance Weber problem
GO Wesolowsky, RF Love - Management Science, 1972 - pubsonline.informs.org
This paper provides a method for approximating optimal location in a multi-facility Weber
problem where rectangular distances apply. Optimality is achieved when the sum of weighted …
problem where rectangular distances apply. Optimality is achieved when the sum of weighted …