Abstract
The median of a network is any point in the network that minimizes the sum of the shortest distances from it to each vertex. Let's omit from this sum the distance to any vertex that is intermediate on the shortest path from the median to another vertex. In other words, include in the sum only the pendant vertices of the shortest distance spanning free. A pendant-median is any point in the network that minimizes this revised sum of the shortest distances. A pendant-median models facility locations in which customers can be served without penalty along the route to other, more distant customers. This paper presents a simple algorithm to locate a pendant-median of a tree network and presents several results for general networks.
Sign-in/Register to access full text options 
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.
