Journal article
Distance Constraints for Tree Network Multifacility Location Problems
Operations research, Vol.26(4), pp.570-596
07/01/1978
DOI: 10.1287/opre.26.4.570
Abstract
We consider the problem of finding locations for new facilities in an imbedded tree network with respect to existing facilities, with upper bounds imposed on distances between all pairs of facilities. We obtain necessary and sufficient conditions, termed separation conditions, for the distance constraints to be consistent. We find string models useful in obtaining insight into the conditions. These separation conditions involve shortest paths through an associated network that has as arc lengths the upper bounds on pair-wise facility distances. Also, we give an algorithm that constructs a feasible solution to the distance constraints if one exists. As an application of the separation conditions, we solve a multifacility minimax location problem. Most of the results obtained in this paper are also true when distances are Tchebyshev between facilities in R
p
, p ≥ 1, or are rectilinear between facilities in R
2
. Further, the results of this paper should be useful in addressing “nonlinear” minimax location problems and multiobjective, multifacility location problems.
Details
- Title: Subtitle
- Distance Constraints for Tree Network Multifacility Location Problems
- Creators
- Richard L. Francis - University of FloridaTimothy J. Lowe - University of FloridaH. Donald Ratliff - University of Florida
- Resource Type
- Journal article
- Publication Details
- Operations research, Vol.26(4), pp.570-596
- DOI
- 10.1287/opre.26.4.570
- ISSN
- 0030-364X
- eISSN
- 1526-5463
- Number of pages
- 27
- Language
- English
- Date published
- 07/01/1978
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963204302771
Metrics
1 Record Views