메뉴 건너뛰기




Volumn 5, Issue 1, 2008, Pages 1-26

The p-center problem on fuzzy networks and reduction of cost

Author keywords

Fuzzy sets; Location; Networks

Indexed keywords


EID: 77953595985     PISSN: 17350654     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (13)

References (33)
  • 1
    • 21244450361 scopus 로고    scopus 로고
    • Enhancement to two exact algorithms for solving the vertex p-center problem
    • A. AJ-khedhairi and S. Salhi, Enhancement to two exact algorithms for solving the vertex p-center problem, Journal of Mathematical Modelling and Algorithms, 4(2) (2005), 129-147.
    • (2005) Journal of Mathematical Modelling and Algorithms , vol.4 , Issue.2 , pp. 129-147
    • Aj-Khedhairi, A.1    Salhi, S.2
  • 2
    • 0141540727 scopus 로고
    • Efficient algorithms for centers and medians in interval and circular-arc graphs
    • D. Bespamyatnikh, B. Bhattacharya, M. Keil, D. Kirkpatric and D. Segal, Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks, 39 (1979), 144-152.
    • (1979) Networks , vol.39 , pp. 144-152
    • Bespamyatnikh, D.1    Bhattacharya, B.2    Keil, M.3    Kirkpatric, D.4    Segal, D.5
  • 6
    • 0020173249 scopus 로고
    • Maximum flow in a network with fuzzy are capacities
    • S. Chanas and W. Kolodziejczyk, Maximum flow in a network with fuzzy are capacities, Fuzzy Sets and Systems, 8 (1982), 165-173.
    • (1982) Fuzzy Sets and Systems , vol.8 , pp. 165-173
    • Chanas, S.1    Kolodziejczyk, W.2
  • 7
    • 0021461218 scopus 로고
    • Real valued flows in a network with fuzzy are capacities
    • S. Chanas and W. Kolodziejczyk, Real valued flows in a network with fuzzy are capacities, Fuzzy Sets and Systems, 13 (1984), 139-151.
    • (1984) Fuzzy Sets and Systems , vol.13 , pp. 139-151
    • Chanas, S.1    Kolodziejczyk, W.2
  • 10
    • 0020119719 scopus 로고
    • Polynomial bounded algorithms for locating p-centers on a tree
    • R. Chandrasekharan and A. Tamir, Polynomial bounded algorithms for locating p-centers on a tree, Mathematics in Programming, 22 (1982), 304-315.
    • (1982) Mathematics in Programming , vol.22 , pp. 304-315
    • Chandrasekharan, R.1    Tamir, A.2
  • 13
    • 0002692698 scopus 로고
    • A procedure for ranking fuzzy numbers using fuzzy relations
    • M. Delgado, J. L. Verdegay and M. A. Vila, A procedure for ranking fuzzy numbers using fuzzy relations. Fuzzy Sets and Systems, 26 (1988), 49-62.
    • (1988) Fuzzy Sets and Systems , vol.26 , pp. 49-62
    • Delgado, M.1    Verdegay, J.L.2    Vila, M.A.3
  • 14
    • 0011252451 scopus 로고
    • On valuation and problems in fuzzy graphs : AA general approach and some particular cases
    • M. Delgado, J. L. Verdegay and M. A. Vila, On valuation and problems in fuzzy graphs : a general approach and some particular cases, ORSA Journal on Computing, 2 (1990), 74-84.
    • (1990) ORSA Journal on Computing , vol.2 , pp. 74-84
    • Delgado, M.1    Verdegay, J.L.2    Vila, M.A.3
  • 17
    • 0018683792 scopus 로고
    • ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS - 1. THE p-CENTERS.
    • O. Kariv and S. L. Hakimi, An algorithmic approach to network location problems, I: the p-centers, S1AM Journal of Applied Mathematics, 37 (1979), 513-538. (Pubitemid 10432631)
    • (1979) SIAM Journal on Applied Mathematics , vol.37 , Issue.3 , pp. 513-538
    • Kariv, O.1    Hakimi, S.L.2
  • 20
    • 2142679347 scopus 로고    scopus 로고
    • Solving the p-center problem with tabu search and variable neighborhood search
    • N. Mledanovic, M. Labbé and P. Hansen, Solving the p-center problem with tabu search and variable neighborhood search, Networks, 42(1) (2003), 48-64.
    • (2003) Networks , vol.4 , Issue.1 , pp. 48-64
    • Mledanovic, N.1    Labbé, M.2    Hansen, P.3
  • 24
    • 27844469772 scopus 로고    scopus 로고
    • Genetic algorithm to solve p-center and p-radius problem on a network
    • S. M. A. Nayeem and M. Pal, Genetic algorithm to solve p-center and p-radius problem on a network, International Journal of Computer Mathematics, 82 (2005), 541-550.
    • (2005) International Journal of Computer Mathematics , vol.82 , pp. 541-550
    • Nayeem, S.M.A.1    Pal, M.2
  • 25
    • 26844440728 scopus 로고    scopus 로고
    • Shortest path problem on a network with imprecise edge weight
    • S. M. A. Nayeem and M. Pal, Shortest path problem on a network with imprecise edge weight, Fuzzy Optimization and Decision Making, 4 (2005), 293-312.
    • (2005) Fuzzy Optimization and Decision Making , vol.4 , pp. 293-312
    • Nayeem, S.M.A.1    Pal, M.2
  • 27
    • 0001499521 scopus 로고    scopus 로고
    • A shortest path problem on a network with fuzzy arc lengths
    • S. Okada and T. Soper, A shortest path problem on a network with fuzzy arc lengths, Fuzzy Sets and Systems, 109 (2000), 129-140.
    • (2000) Fuzzy Sets and Systems , vol.109 , pp. 129-140
    • Okada, S.1    Soper, T.2
  • 28
    • 26444572311 scopus 로고    scopus 로고
    • An exact algorithm for the capacitated vertex p-center problem
    • F. A. Özsoy and MÇ. Pinar, An exact algorithm for the capacitated vertex p-center problem, Computers and Operations Research, 33(5) (2006), 1420-1436.
    • (2006) Computers and Operations Research , vol.33 , Issue.5 , pp. 1420-1436
    • Özsoy, F.A.1    ̧, C.P.M.2
  • 32
    • 0000486559 scopus 로고
    • Improved complexity bounds for center location problems on networks by using dynamic data structures
    • A. Tamir, Improved complexity bounds for center location problems on networks by using dynamic data structures, SIAM Journal of Discrete Mathematics, 1 (1988), 377-396.
    • (1988) SIAM Journal of Discrete Mathematics , vol.1 , pp. 377-396
    • Tamir, A.1


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