Distance Constraints for Tree Network Multifacility Location Problems

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 Rp, p ≥ 1, or are rectilinear between facilities in R2. Further, the results of this paper should be useful in addressing “nonlinear” minimax location problems and multiobjective, multifacility location problems.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 55 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.