The Minmax Relative Regret Median Problem on Networks

References

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