TY - JOUR
T1 - The centdian subtree on tree networks
AU - Tamir, Arie
AU - Puerto, Justo
AU - Pérez-Brito, Dionisio
PY - 2002/5/15
Y1 - 2002/5/15
N2 - This paper describes an O(n log n) algorithm for finding the optimal location of a tree shaped facility of a specified size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-off minisum (efficiency) and minimax (equity) approaches.
AB - This paper describes an O(n log n) algorithm for finding the optimal location of a tree shaped facility of a specified size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-off minisum (efficiency) and minimax (equity) approaches.
KW - Location
KW - Networks
KW - Path
KW - Tree
UR - http://www.scopus.com/inward/record.url?scp=84867936125&partnerID=8YFLogxK
U2 - 10.1016/S0166-218X(01)00199-8
DO - 10.1016/S0166-218X(01)00199-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84867936125
SN - 0166-218X
VL - 118
SP - 263
EP - 278
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 3
ER -