Abstract
This paper considers the problem of locating a path-shaped facility of a specific size on a weighted tree network. The criterion for optimality used in this paper is the minimax criterion in which the weighted distance to the farthest vertex from the facility is minimised. The minimax criterion gives acceptable results from the point of view of the fast response for the clients who are located far away from the facility. This location problem usually has applications in computer science, information science, and operations research. An O(n) time algorithm is proposed for finding the optimal location of a path-shaped facility of a bounded length on a weighted tree network, where n is the number of vertices in the tree.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
