2Hakimi S. L. Optimum locations of switching centers and the absolute centers and medians of a graph[J]. Operations Research, 1965,13:450～459.
3Current J, Min H, Schilling D. Mutiobjective analysis of facility location decisions[J]. European Journal of Operational Research, 1990,49: 295～307.
4Kariv O And Hakimi SL. An algorithmic approach to network location problems, Part I, the P-centers[J]. SIAM. J. Appl. Math, 1997a, 37:513 - 538.
5Averbakh I, Berman Oded. Minimax regret p-center location on a network with demand uncertainy[J]. Location Science, 1997,5(4): 247～254.
6Arie tamir, Dionision Pérez-Brito, JoséA, Moreno-Pérez. Polynomial Algorithm for the p-centdian problem on a tree[J]. Networks, 1998,32(14):255 ～ 262.
7Douglas Moon I, Lee Papayanopoluos. Facility location on a tree with maximum distance constraints[J]. Computers and Operations Research,1995,22(9):905 ～ 914.
8Dionisio Pérez-Brito, José A. Moreno-Pérez. The 2-faclity centdian network problem[J]. Location Science, 1998,6:369 ～ 381.
9Chen S'Nahrstedt K.On finding multi-constrained paths[C].IEEE International Conference on Communications'1998.
10CHEN Shi-gang.An overview of quality-of-service routing for the next generation high-speed networks:Problems and Solutions[J].IEEE Network'1998'12 (6):64-79.
