The minmax regret gradual covering location problem on a network with incomplete information of demand weights

European Journal of Operational Research

Volumn 208, Issue 3, 2011, Pages 233-238

  Berman, Oded ^a   Wang, Jiamin ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b LONG ISLAND UNIVERSITY   (United States)

Author keywords

Gradual covering location; Incomplete information; Location; Minmax regret; Network

Indexed keywords

DECAY FUNCTION; GENERAL NETWORKS; GRADUAL COVERING LOCATION; INCOMPLETE INFORMATION; LOCATION PROBLEMS; MEDIAN PROBLEM; MINMAX REGRET; NETWORK; PARTIAL COVERAGE; POLYNOMIAL-TIME ALGORITHMS; WORST-CASE COVERAGE;

POLYNOMIAL APPROXIMATION; RANDOM VARIABLES; SITE SELECTION;

PROBABILITY DISTRIBUTIONS;

EID: 78549246150     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.08.016     Document Type: Article

References (22)

1. I. Averbakh, and O. Berman Minimax regret p-center location on a network with demand uncertainty Location Science 5 1997 247 254
2. I. Averbakh, and O. Berman Minmax regret median location on a network under uncertainty INFORMS Journal of Computing 12 2000 104 110
3. I. Averbakh, and O. Berman Algorithms for the robust 1-center problem on a tree European Journal of Operational Research 123 2000 292 302
4. I. Averbakh, and O. Berman An improved algorithm for the minmax regret median problem on a tree Networks 41 2003 97 103
5. O. Berman, D. Krass, and Z. Drezner The gradual covering decay location problem on a network European Journal of Operational Research 151 2003 474 480
6. O. Berman, and J. Wang The probabilistic 1-maximal covering problem on a network with discrete demand weights Journal of the Operational Research Society 59 2008 1398 1405
7. D. Bertsimas, and M. Sim Robust discrete optimization and network flows Mathematical Programming 98 2003 49 71
8. B. Chen, and C.-S. Lin Minmax-regret robust 1-median location on a tree Networks 31 1998 93 103 (Pubitemid 128368411)
9. R.L. Church, and L.E. Meadows Location modeling utilizing maximum service distance criteria Geographical Analysis 11 1979 358 373
10. R.L. Church, and C. ReVelle The maximal covering location problem Papers of the Regional Science Association 32 1974 101 118
11. R.L. Church, and K.L. Roberts Generalized coverage models and public facility location Papers of the Regional Science Association 53 1984 117 135
12. M.E. Dyer Linear time algorithms for two- and three-variable linear programs SIAM Journal of Computing 13 1984 31 45
13. S. French Uncertainty and imprecision: Modelling and analysis Journal of the Operational Research Society 46 1995 70 79
14. G.Y. Handler p-Center problems P.B. Mirchandani, R.L. Francis, Discrete Facility Location 1990 Wiley New York, NY 205 346
15. Kouvelis, P., Variktarakis, G., Yu, G., 1994. Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Working Paper 93/94-3-4, Department of Management Science and Information Systems, Graduate School of Business, The University of Texas, Austin, TX.
16. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 1997 Kluwer Boston, MA
17. 3 and related programs SIAM Journal of Computing 12 1983 759 776
18. J. Milnor Games against nature R. Thrall, C. Coombs, R. Davis, Decision Processes 1954 John Wiley London 49 60
19. C. Revelle, and J.C. Williams Reserve Design and Facility Siting Z. Drezner, H.W. Hamacher, Facility Location: Applications and Theory 2002 Springer-Verlag Berlin 307 328
20. T.L. Saaty, and G.V. Vargas Uncertainty and rank order in the analytic hierarchy process European Journal of Operational Research 32 1987 107 117
21. L.J. Savage The theory of statistical decision Journal of the American Statistics Association 46 1954 55 67
22. K. Weichselberger The theory of interval-probability as a unifying concept for uncertainty International Journal of Approximate Reasoning 24 2000 149 170