Distance Constraints for Tree Network Multifacility Location Problems.
Abstract
The problem of finding locations of new facilities in an imbedded tree network with respect to existing facilities, with upper bounds imposed on distances between all pairs of facilities was considered. The separation conditions are related to shortest paths through an associated network, which has as arc lengths the upper bounds on pairwise facility distances. Also an algorithm was given which constructs a feasible solution to the distance constraints if one exists. As an application the separation conditions were solved for a multifacility minimax location problem. Further, the results of this paper should be useful in addressing nonlinear minimax location problems, and multiobjective, multifacility location problems.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1976
- Accession Number
- ADA025287
Entities
People
- H. Donald Ratliff
- Richard L. Francis
- Timothy J. Lowe
Organizations
- University of Florida