메뉴 건너뛰기




Volumn 82, Issue 5, 2005, Pages 541-550

Genetic algorithm to solve the p-centre and p-radius problem on a network

Author keywords

Facility location problem; Genetic algorithm; Network; p centre problem

Indexed keywords

GENETIC ALGORITHMS; PROBLEM SOLVING;

EID: 27844469772     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160512331323380     Document Type: Article
Times cited : (6)

References (13)
  • 1
    • 0003780715 scopus 로고
    • Reading, MA: Addison-Wesley
    • Harary, F., 1969, Graph Theory (Reading, MA: Addison-Wesley).
    • (1969) Graph Theory
    • Harary, F.1
  • 2
    • 0018683792 scopus 로고
    • An algorithmic approach to network location problems. I: The p-centers
    • 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.
    • (1979) SIAM Journal of Applied Mathematics , vol.37 , pp. 513-538
    • Kariv, O.1    Hakimi, S.L.2
  • 3
    • 0000423549 scopus 로고
    • New results on the complexity of p-center problems
    • Magiddo, N. and Tamir, A., 1983. New results on the complexity of p-center problems. SIAM Journal of Computing, 12, 751-759.
    • (1983) SIAM Journal of Computing , vol.12 , pp. 751-759
    • Magiddo, N.1    Tamir, A.2
  • 4
    • 0000486559 scopus 로고
    • Improved complexity bounds for center location problems on networks by using dynamic data structures
    • 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.
    • (1988) SIAM Journal of Discrete Mathematics , vol.1 , pp. 377-396
    • Tamir, A.1
  • 5
    • 0020119719 scopus 로고
    • Polynomial bounded algorithms for locating p-centers on a tree
    • Chandrasekharan, R. and Tamir, A., 1982, Polynomial bounded algorithms for locating p-centers on a tree. Mathematics in Programming, 22, 304-315.
    • (1982) Mathematics in Programming , vol.22 , pp. 304-315
    • Chandrasekharan, R.1    Tamir, A.2
  • 6
    • 0141540727 scopus 로고    scopus 로고
    • Efficient algorithms for centers and medians in interval and circular-arc graphs
    • 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.
    • (2002) Networks , vol.39 , pp. 144-152
    • Bespamyatnikh, D.1    Bhattacharya, B.2    Keil, M.3    Kirkpatrick, D.4    Segal, D.5
  • 13
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest paths
    • Floyd, R.W., 1962, Algorithm 97: shortest paths. Communications of the ACM, 5, 345.
    • (1962) Communications of the ACM , vol.5 , pp. 345
    • Floyd, R.W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.