메뉴 건너뛰기




Volumn 127, Issue 3, 2003, Pages 505-522

Complexity of robust single facility location problems on networks with uncertain edge lengths

Author keywords

Location; Minmax regret optimization; NP completeness

Indexed keywords


EID: 84867978641     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00384-0     Document Type: Article
Times cited : (42)

References (17)
  • 1
    • 0034258920 scopus 로고    scopus 로고
    • Minmax regret solutions for minimax optimization problems with uncertainty
    • I. Averbakh Minmax regret solutions for minimax optimization problems with uncertainty Oper. Res. Lett. 27 2 2000 57 65
    • (2000) Oper. Res. Lett. , vol.27 , Issue.2 , pp. 57-65
    • Averbakh, I.1
  • 2
    • 84867998655 scopus 로고    scopus 로고
    • Algorithms for robust center problems
    • Dallas, October
    • I. Averbakh, O. Berman, Algorithms for robust center problems. Presented at INFORMS Conference, Dallas, October, 1997.
    • (1997) INFORMS Conference
    • Averbakh, I.1    Berman, O.2
  • 3
    • 0007063545 scopus 로고    scopus 로고
    • Minmax regret robust median location on a network under uncertainty
    • I. Averbakh, and O. Berman Minmax regret robust median location on a network under uncertainty INFORMS J. Comput. 12 2 2000 104 110
    • (2000) INFORMS J. Comput. , vol.12 , Issue.2 , pp. 104-110
    • Averbakh, I.1    Berman, O.2
  • 4
    • 0033880387 scopus 로고    scopus 로고
    • Algorithms for the robust 1-center problem
    • I. Averbakh, and O. Berman Algorithms for the robust 1-center problem Eur. J. Oper. Res. 123 2000 292 302
    • (2000) Eur. J. Oper. Res. , vol.123 , pp. 292-302
    • Averbakh, I.1    Berman, O.2
  • 5
    • 0040585259 scopus 로고    scopus 로고
    • Robust one-median location problem
    • B. Chen, and C. Lin Robust one-median location problem Networks 31 1998 93 103
    • (1998) Networks , vol.31 , pp. 93-103
    • Chen, B.1    Lin, C.2
  • 6
    • 0001022430 scopus 로고
    • Optimum locations on a graph with probabilistic demands
    • H. Frank Optimum locations on a graph with probabilistic demands Oper. Res. 14 1966 409 421
    • (1966) Oper. Res. , vol.14 , pp. 409-421
    • Frank, H.1
  • 7
    • 0005887255 scopus 로고
    • Optimum locations on a graph with correlated normal demands
    • H. Frank Optimum locations on a graph with correlated normal demands Oper. Res. 14 1967 552 557
    • (1967) Oper. Res. , vol.14 , pp. 552-557
    • Frank, H.1
  • 9
    • 0003279542 scopus 로고
    • Optimal center location in simple networks
    • A.J. Goldman Optimal center location in simple networks Transportation Sci. 5 1971 212 221
    • (1971) Transportation Sci. , vol.5 , pp. 212-221
    • Goldman, A.J.1
  • 13
    • 0001160877 scopus 로고
    • Sensitivity analysis in minisum facility location problems
    • M. Labbe, J.-F. Thisse, and R. Wendell Sensitivity analysis in minisum facility location problems Oper. Res. 39 1991 961 969
    • (1991) Oper. Res. , vol.39 , pp. 961-969
    • Labbe, M.1    Thisse, J.-F.2    Wendell, R.3
  • 15
    • 0018468260 scopus 로고
    • Location of medians on stochastic networks
    • P.B. Mirchandani, and A.R. Odoni Location of medians on stochastic networks Transportation Sci. 13 1979 85 97
    • (1979) Transportation Sci. , vol.13 , pp. 85-97
    • Mirchandani, P.B.1    Odoni, A.R.2
  • 16
    • 85108976174 scopus 로고
    • Robust optimization of large scale systems
    • J.M. Mulvey, R.J. Vanderbei, and S.A. Zenios Robust optimization of large scale systems Oper. Res. 43 2 1995 264 281
    • (1995) Oper. Res. , vol.43 , Issue.2 , pp. 264-281
    • Mulvey, J.M.1    Vanderbei, R.J.2    Zenios, S.A.3


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