Distance Constraints for Tree Network Multifacility Location Problems.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
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.
- Theoretical Mathematics