TY - JOUR

T1 - A polynomial algorithm for the p-centdian problem on a tree

AU - Tamir, Arie

AU - Pérez-Brito, Dionisio

AU - Moreno-Pérez, José A.

PY - 1998/12

Y1 - 1998/12

N2 - The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is minimized. The p-center problem is concerned with the location of p-points (centers) on the network, such that the maximum (weighted) distance of all the nodes to their respective nearest points is minimized. To capture more real-world problems and obtain a good way to trade-off minisum (efficiency) and minimax (equity) approaches, Halpern introduced the centdian model, where the objective is to minimize a convex combination of the objective functions of the center and the median problems. In this paper, we studied the p-centdian problem on tree networks and present the first polynomial time algorithm for this problem.

AB - The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is minimized. The p-center problem is concerned with the location of p-points (centers) on the network, such that the maximum (weighted) distance of all the nodes to their respective nearest points is minimized. To capture more real-world problems and obtain a good way to trade-off minisum (efficiency) and minimax (equity) approaches, Halpern introduced the centdian model, where the objective is to minimize a convex combination of the objective functions of the center and the median problems. In this paper, we studied the p-centdian problem on tree networks and present the first polynomial time algorithm for this problem.

UR - http://www.scopus.com/inward/record.url?scp=0040577818&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O

DO - 10.1002/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0040577818

SN - 0028-3045

VL - 32

SP - 255

EP - 262

JO - Networks

JF - Networks

IS - 4

ER -