Minimax regret p-center location on a network with demand uncertainty

Location Science

Volumn 5, Issue 4, 1997, Pages 247-254

  Averbakh, I ^a   Berman, Oded ^b  

^a WESTERN WASHINGTON UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; FACILITY LOCATION; LOCATION DECISION; MODELING; TRANSPORTATION SYSTEM;

EID: 0031393534     PISSN: 09668349     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0966-8349(98)00033-3     Document Type: Article

References (9)

1. Drezner, Z. & Wesolowsky, G. O. (1980) A. maximum location problem with maximum distance constraints. IIE Transactions, 12, 249-252.
2. Frank, H. (1966) Optimum locations on a graph with probabilistic demands. Operations Research., 14, 409-421.
3. Kariv, O. & Hakimi, S. L. (1979) An algorithmic approach to network location problems. Part 1: the p-centers. SIAM Journal of Applied Mathematics, 37, 513-538.
4. Kouvelis, P., Vairaktarakis, G. & Yu, G. (1993) Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Working Paper 93/94-3-4, The University of Texas at Austin, Graduate School of Business.
5. Labbe, M., Peeters, D. & Thisse, J.-F. (1995) Location on Networks. In Handbooks in Operations Research and Management Science, Vol. 8, G. L. Nemhauser & A. H. G. Rinnooy Kan (eds). Elsevier, New York, pp. 551-624.
6. Labbe., M., Thisse., J.-F. & Wendell, R. (1991) Sensitivity analysis in minisum facility location proö/ems. Operations Research, 39, 961-969.
7. Megiddo, N. & Tamir, A. (1983) New results on the complexity of p-center problems. SIAM Journal on Computing, 12, 751-758.
8. Mirchandani, P. B. & Francis, R. L. (eds) (1990) Discrete Location Theory. Wiley, New York.
9. Tansei, B. & Scheuenstudl, G. (1988) Facility location on tree networks with imprecise data. Research Report IEOR-8819, Bilkent University.