Minmax regret location-allocation problem on a network under uncertainty

European Journal of Operational Research

Volumn 179, Issue 3, 2007, Pages 1025-1039

  Conde, Eduardo ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Complexity; Location problems; Polynomial algorithms; Robust optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

LOCATION PROBLEMS; POLYNOMIAL ALGORITHMS; ROBUST OPTIMIZATION;

TRACKING (POSITION);

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

References (24)

1. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming 90 (2001) 263-272
2. Averbakh I., and Berman O. Algorithms for the robust 1-center problem on a tree. European Journal of Operational Research 123 (2000) 292-302
3. Averbakh I., and Berman O. Minmax regret median location on a network under uncertainty. INFORMS J Comput 12 (2000) 104-110
4. Averbakh I., and Berman O. An improved algorithm for the minmax regret median problem on a tree. Networks 41 (2003) 97-103
5. Burkard R.E., and Dollani H. A note on the robust 1-center problem on trees. Annals of Operations Research 110 (2002) 69-82
6. Carrizosa E., and Conde E. A fractional model for locating semi-desirable facilities on networks. European Journal of Operational Research 136 (2002) 67-80
7. Carrizosa E., Hamacher H., Klein R., and Nickel S. Solving nonconvex planar location problems by finite dominating sets. Journal of Global Optimization 18 (2000) 195-210
8. Chen B., and Lin C.S. Minmax-regret robust 1-median location on a tree. Networks 31 (1998) 93-103
9. Conde E. An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Mathematical Programming 100 2 (2004) 345-353
10. Durier R., and Michelot C. Geometrical properties of the Fermat-Weber problem. European Journal of Operational Research 20 (1985) 332-343
11. Floyd R.W. Algorithm 97, shortest path. Communications of the ACM 5 (1962) 345
12. Hooker J.N., Garfinkel R.S., and Chen C.K. Finite dominating sets for network location problems. Operations Research 39 (1991) 100-118
13. Horst R., and Tuy H. Global Optimization. Deterministic Approaches (1996), Springer-Verlag, Berlin
14. Johnson D. Efficient algorithms for shortest paths in sparse graphs. Journal of the ACM 24 (1977) 1-13
15. Kalcsics J., Nickel S., Puerto J., and Tamir A. Algorithmic results for ordered median problems. Operations Research Letters 30 (2002) 149-158
16. Michelot C. The mathematics of continuous location. Studies in Locational Analysis 5 (1993) 59-83
17. Plastria F. Continuous Location Problems. In: Drezner Z. (Ed). Facility Location. A Survey of Applications and Methods (1995), Springer-Verlag, New-York 225-262
18. Rodri{dotless}́guez-Chi{dotless}́a A., Nickel S., Puerto J., and Fernández F.R. A flexible approach to location problems. Mathematical Methods of Operations Research 51 (2000) 69-89
19. Romero-Morales D., Carrizosa E., and Conde E. Semi-obnoxious location models: A global optimization approach. European Journal of Operational Research 102 (1997) 295-301
20. Takaoka T. A new upper bound on the complexity of the all pairs shortest path problem. Information Processing Letters 43 (1992) 195-199
21. Tamir A. Sorting weighted distances with applications to objective function evaluations in single facility location problems. Operations Research Letters 32 (2004) 249-257
22. M. Thorup, Undirected single source shortest paths in linear time, in: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, 1997, pp. 12-21.
23. M. Thorup, Floats, integers, and single source shortest paths, in: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, 1998, pp. 14-24.
24. Wets R.J.-B. Stochastic Programming. In: Nemhauser G.L., Rinnooy Kan A.H.G., and Todd M.J. (Eds). Handbooks in Operations Research and Management Science vol. 1 (1989), North-Holland, Amsterdam 573-630 Chapter 8