References
- Harary , F. 1969 . Graph Theory Reading, MA : Addison-Wesley .
- Kariv , O. and Hakimi , S. L. 1979 . An algorithmic approach to network location problems. I: The p-centers . SIAM Journal of Applied Mathematics , 37 : 513 – 538 .
- Magiddo , N. and Tamir , A. 1983 . New results on the complexity of p-center problems . SIAM Journal of Computing , 12 : 751 – 759 .
- Tamir , A. 1988 . Improved complexity bounds for center location problems on networks by using dynamic data structures . SIAM Journal of Discrete Mathematics , 1 : 377 – 396 .
- Chandrasekharan , R. and Tamir , A. 1982 . Polynomial bounded algorithms for locating p-centers on a tree . Mathematics in Programming , 22 : 304 – 315 .
- Bespamyatnikh , D. , Bhattacharya , B. , Keil , M. , Kirkpatrick , D. and Segal , D. 2002 . Efficient algorithms for centers and medians in interval and circular-arc graphs . Networks , 39 : 144 – 152 .
- Handler , D. Y. and Mirchandani , P. B. 1979 . Location on Networks: Theory and Algorithms Cambridge, MA : MIT Press .
- Mirchandani , P. B. and Francis , R. L. 1990 . Discrete Location Theory , New York : Wiley .
- Holland , J. H. 1975 . Adaptation in Natural and Artificial Systems Ann Arbor, MI : University of Michigan Press .
- Goldberg , D. E. 1989 . Genetic Algorithm in Search, Optimization and Machine Learning Reading, MI : Addison-Wesley .
- Michalewicz , Z. 1992 . Genetic Algorithms + Data Structures=Evolution Programs , Berlin : Springer-Verlag .
- Mitchell , M. 1996 . An Introduction to Genetic Algorithms Cambridge, MA : MIT Press .
- Floyd , R. W. 1962 . Algorithm 97: shortest paths . Communications of the ACM , 5 : 345