메뉴 건너뛰기




Volumn 7, Issue 3, 1997, Pages 325-337

Annealing Algorithms for Multisource Absolute Location Problems on Graph

Author keywords

Combinatorial optimization; Location problems; Simulated annealing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; FUNCTION EVALUATION; GRAPH THEORY; ITERATIVE METHODS; PROBLEM SOLVING;

EID: 0031144567     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008612929672     Document Type: Article
Times cited : (2)

References (12)
  • 1
    • 0000811083 scopus 로고
    • The m-center problem: Minimax facility location
    • R.S. Garfinkel, A.W. Neebe, and M.R. Rao, "The m-center problem: Minimax facility location," Management Science, vol. 23, no. 10, pp. 1133-1142, 1977.
    • (1977) Management Science , vol.23 , Issue.10 , pp. 1133-1142
    • Garfinkel, R.S.1    Neebe, A.W.2    Rao, M.R.3
  • 3
    • 0020126635 scopus 로고
    • Algorithms for the m-center problems: A survey
    • J. Halpern and O. Maimon, "Algorithms for the m-center problems: A survey," Europ. J. of Oper. Res., vol. 10, pp. 90-99, 1982.
    • (1982) Europ. J. of Oper. Res. , vol.10 , pp. 90-99
    • Halpern, J.1    Maimon, O.2
  • 5
    • 0007062640 scopus 로고
    • An axiomatic approach to location on networks
    • R. Holzman, "An axiomatic approach to location on networks," Mathematics of Operations Research, vol. 15, no. 3, pp. 553-563, 1990.
    • (1990) Mathematics of Operations Research , vol.15 , Issue.3 , pp. 553-563
    • Holzman, R.1
  • 6
    • 0018683792 scopus 로고
    • An algorithmic approach to network location problems. Part I-II
    • O. Kariv and S.L. Hakimi, "An algorithmic approach to network location problems. Part I-II," SIAM J. on Appl. Math., vol. 37, pp. 513-538, 1979.
    • (1979) SIAM J. on Appl. Math. , vol.37 , pp. 513-538
    • Kariv, O.1    Hakimi, S.L.2
  • 7
    • 0342629301 scopus 로고
    • An annealing approach to multifacility location problems in Euclidean spaces
    • F. Maffioli and G. Righini, "An annealing approach to multifacility location problems in Euclidean spaces," Location Science, vol. 2, no. 4, pp. 205-222, 1994.
    • (1994) Location Science , vol.2 , Issue.4 , pp. 205-222
    • Maffioli, F.1    Righini, G.2
  • 9
    • 0019649066 scopus 로고
    • A polynomial time algorithm for finding the absolute center of a network
    • E. Minieka, "A polynomial time algorithm for finding the absolute center of a network," Networks, vol. 11, pp. 351-355, 1981.
    • (1981) Networks , vol.11 , pp. 351-355
    • Minieka, E.1
  • 11
    • 2342589155 scopus 로고
    • Un algoritmo per il problema del centro assoluto su rete
    • A. Sepe and A. Sforza, "Un algoritmo per il problema del centro assoluto su rete (An algorithm for the absolute center problem on network)," Ricerca Operativa, vol. 39, pp. 71-105, 1986.
    • (1986) Ricerca Operativa , vol.39 , pp. 71-105
    • Sepe, A.1    Sforza, A.2
  • 12
    • 0020722396 scopus 로고
    • Optimal locations for a class of non-linear, single-facility location problems on a network
    • D.R. Shier and P.M. Dearing, "Optimal locations for a class of non-linear, single-facility location problems on a network," Operations Research, vol. 31, pp. 292-303, 1983.
    • (1983) Operations Research , vol.31 , pp. 292-303
    • Shier, D.R.1    Dearing, P.M.2


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