메뉴 건너뛰기




Volumn , Issue , 2011, Pages 243-246

A relatively robust optimization algorithm for emergency facility location

Author keywords

Emergency facility; Locating; Relatively robust optimization

Indexed keywords

COMPARISON RESULT; CORRESPONDING WEIGHTS; EMERGENCY FACILITY; FACILITY LOCATIONS; INTERVAL ESTIMATE; LOCATING; OBJECTIVE FUNCTIONS; OPTIMIZATION FUNCTION; ROBUST OPTIMIZATION; ROBUST OPTIMIZATION ALGORITHM; UNCERTAIN DEMAND; WEIGHTED DISTANCE;

EID: 80052467640     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSESS.2011.5982299     Document Type: Conference Paper
Times cited : (1)

References (12)
  • 1
    • 84870439179 scopus 로고    scopus 로고
    • Title of paper with only first word capitalized
    • in press
    • R. Nicole, "Title of paper with only first word capitalized, " J. Name Stand. Abbrev., in press.
    • J. Name Stand. Abbrev.
    • Nicole, R.1
  • 2
    • 85108976174 scopus 로고
    • Robust optimization of large scale systems [J]
    • Mulvey J M, Vanderbei R J. Robust Optimization of Large scale systems [J]. Operations Research, 1995, 43(2):264-281.
    • (1995) Operations Research , vol.43 , Issue.2 , pp. 264-281
    • Mulvey, J.M.1    Vanderbei, R.J.2
  • 4
    • 0034258920 scopus 로고    scopus 로고
    • Minmax regret solutions for minimax optimization problems with uncertainty [J]
    • Averbakh I.Minmax regret solutions for minimax optimization problems with uncertainty [J]. Operations Research Letters, 2003, 27(2):57-65.
    • (2003) Operations Research Letters , vol.27 , Issue.2 , pp. 57-65
    • Averbakh, I.1
  • 6
    • 0033880387 scopus 로고    scopus 로고
    • Algorithms for the robust 1-center problem on a tree [J]
    • Averbakh I, Berman O. Algorithms for the robust 1-center problem on a tree [J]. European Journal of Operational Research, 2000, 123(2):292-302.
    • (2000) European Journal of Operational Research , vol.123 , Issue.2 , pp. 292-302
    • Averbakh, I.1    Berman, O.2
  • 7
    • 0031393534 scopus 로고    scopus 로고
    • Minimax regretp-center location on a network with demand uncertainty [J]
    • Averbakh I, Berman O. Minimax regretp-center location on a network with demand uncertainty [J]. Location Science, 1997, 5(4): 247-254.
    • (1997) Location Science , vol.5 , Issue.4 , pp. 247-254
    • Averbakh, I.1    Berman, O.2
  • 8
    • 27944509527 scopus 로고    scopus 로고
    • The minmax relative regret median problem on networks [J]
    • Averbakh I. The minmax relative regret median problem on networks [J]. Informs Journal on Computing, 2005, 17(4):451-461.
    • (2005) Informs Journal on Computing , vol.17 , Issue.4 , pp. 451-461
    • Averbakh, I.1
  • 9
    • 33845952870 scopus 로고    scopus 로고
    • Minmax regret location-allocation problem on a network under uncertainty [J]
    • Eduardo C. Minmax regret location-allocation problem on a network under uncertainty [J]. European Journal of Operational Research, 2007, (179):1025-1039.
    • (2007) European Journal of Operational Research , Issue.179 , pp. 1025-1039
    • Eduardo, C.1
  • 10
    • 69749099918 scopus 로고    scopus 로고
    • Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights [J]
    • Adam K A, Pawe?Z.Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights [J]. European Journal of Operational Research, 2010, (200):680-687.
    • (2010) European Journal of Operational Research , Issue.200 , pp. 680-687
    • Adam, K.A.1    Pawe, Z.2
  • 12
    • 80052512491 scopus 로고    scopus 로고
    • Robust optimization of hub-and-spoke airline network design based on shortest path algorithm [J]
    • Jiang Tao, Zhu Jin-fu, Qin Yi. Robust optimization of hub-and-spoke airline network design based on shortest path algorithm [J]. Systems Engineering, 2007, 25(1):53-59.
    • (2007) Systems Engineering , vol.25 , Issue.1 , pp. 53-59
    • Jiang, T.1    Zhu, J.-F.2    Qin, Y.3


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