The minmax relative regret median problem on networks

INFORMS Journal on Computing

Volumn 17, Issue 4, 2005, Pages 451-461

  Averbakh, Igor ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Analysis of algorithms; Facilities location; Networks

Indexed keywords

EID: 27944509527     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0080     Document Type: Review

References (26)

1. Agarwal, P., M. Sharir. 1998. Efficient algorithms for geometric optimization. Comput. Surveys 30 412-458.
2. Averbakh, I. 2000. Minmax regret solutions for minimax optimization problems with uncertainty. Oper. Res. Lett. 27 57-65.
3. Averbakh, I. 2003. Complexity of robust single facility location problems on networks with uncertain edge lengths. Discrete Appl. Math. 127 505-522.
4. Averbakh, I., O. Berman. 2000. Minmax regret median location on a network under uncertainty. INFORMS J. Comput. 12 104-110.
5. Averbakh, I., O. Berman. 2003. An improved algorithm for the minmax regret median problem on a tree. Networks 41 97-103.
6. Ben-Tal, A., A. Nemirovski. 1998. Robust convex optimization. Math. Oper. Res. 23 769-805.
7. Berman, O., D. Krass. 2002. Facility location problems withstoch astic demands and congestion. Z. Drezner, H. W. Hamacher, eds. Location Analysis: Applications and Theory. Springer-Verlag, New York, 329-371.
8. Burkard, R., H. Dollani. 2001. Robust location problems with pos/neg weights on a tree. Networks 38 102-113.
9. Chen, B., C. Lin. 1998. Robust one-median location problem. Networks 31 93-103.
10. Cole, R. 1987. Slowing down sorting networks to obtain faster sorting algorithms. J. Assoc. Comput. Mach. 34 200-208.
11. Dyer, M. E. 1984. Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput. 13 31-45.
12. Fernandez, F. R., S. Nickel, J. Puerto, A. M. Rodriguez-Chia. 2001. Robustness in the Pareto-solutions for the multicriteria minisum location problem. J. Multicriteria Decision Anal. 10 191-203.
13. Frank, H. 1966. Optimum locations on a graph with probabilistic demands. Oper. Res. 14 409-421.
14. Frank, H. 1967. Optimum locations on a graph with correlated normal demands. Oper. Res. 14 552-557.
15. Goldman, A. J. 1971. Optimal center locations in simple networks. Transportation Sci. 5 212-221.
16. Hakimi, S. L. 1964. Optimum location of switching centers and the absolute centers and medians of a graph. Oper. Res. 12 450-459.
17. Kariv, O., S. L. Hakimi. 1979. An algorithmic approach to network location problems: Part 2. The p-medians. SIAM J. Appl. Math. 37 539-560.
18. Kouvelis, P., G. Vairaktarakis, G. Yu. 1993. Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Working paper 93/94-3-4, MSIT Department, Graduate School of Business, University of Texas, Austin, TX.
19. Kouvelis, P., G. Yu. 1997. Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston, MA.
20. Labbe, M., J.-F. Thisse, R. Wendell. 1991. Sensitivity analysis in minisum facility location problems. Oper. Res. 39 961-969.
21. 3 and related problems. SIAM J. Comput. 12 759-776.
22. Megiddo, N. 1983b. Applying parallel algorithms in the design of serial algorithms. J. Assoc. Comput. Mach. 30 852-865.
23. Mirchandani, P. B., A. R. Odoni. 1979. Location of medians on stochastic networks. Transportation Sci. 13 85-97.
24. Mulvey, J. M., R. J. Vanderbei, S. A. Zenious. 1995. Robust optimization of large scale systems. Oper. Res. 43 264-281.
25. Reif, J., ed. 1993. Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo, CA.
26. Wesolowsky, G. O. 1977. Probabilistic weights in the one-dimensional facility location problem. Management Sci. 24 224-229.