A linear algorithm for a minimax location of a path-shaped facility with a specific length in a weighted tree network

Abdallah W. Aboutahoun and Fatma El-Safty

International Journal of Operational Research, 2021, vol. 41, issue 2, 218-225

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.

Keywords: tree network; facility location; minimax criterion; central path. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=115626 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:41:y:2021:i:2:p:218-225

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().