Minmax regret solutions for minimax optimization problems with uncertainty

Operations Research Letters

Volumn 27, Issue 2, 2000, Pages 57-65

  Averbakh, Igor ^a  

^a WESTERN WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; UNCERTAIN SYSTEMS;

MINMAX REGRET OPTIMIZATION; POLYNOMIAL ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0034258920     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(00)00025-0     Document Type: Article

References (28)

1. I. Averbakh, O. Berman, Bottleneck Steiner subnetwork problems with k-connectivity constraints, INFORMS J. Comput. 8 (4) (1996) pp. 361-366.
2. I. Averbakh, O. Berman, Minmax regret median location on a network under uncertainty, INFORMS J. Comput., to appear.
3. I. Averbakh, O. Berman, Minmax regret p-center location on a network with demand uncertainty, Working paper, University of Toronto, Faculty of Management, Toronto, 1996.
4. O. Berman, G.Y. Handler, Optimal minimax path of a single service unit on a network to nonservice destinations, Transp. Sci. 21 (1987) 115-122.
5. A. Borodin, R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998.
6. P.M. Camerini, The minimax spanning tree problem and some extensions, Inform. Process. Lett. 7 (1978) 10-14.
7. N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire, M. Warmuth, How to use expert advice, J. Assoc. Comput. Mach. 44 (3) (1997) 427-485.
8. M.S. Chang, C.Y. Tang, R.C.T. Lee, Solving Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs, Discrete Appl. Math. 39 (1992) 1-12.
9. B. Chen, C. Lin, Robust one-median location problem, Networks 31 (1998) 93-103.
10. D. Chhajed, T. Lowe, m-median and m-center problems with mutual communication: solvable special cases, Oper. Res. 40 (1992) S56-S66.
11. T.M. Cover, Universal portfolios, Math. Finance 1 (1) (1991) 1-29.
12. E. Erkut, R.L. Francis, A. Tamir, Distance constrained multifacility minimax location problems on tree networks, Networks 22 (1992) 37-54.
13. R.L. Francis, T.J. Lowe, H.D. Ratliff, Distance constraints for tree network multifacility location problems, Oper. Res. 26 (1978) 571-596.
14. P. Hansen, Bicriterion Path Problems, Lecture Notes in Economics and Mathematical Systems, Vol. 177, Springer, Berlin, 1980, pp. 109-127.
15. P. Kail, S. Wallace, Stochastic Programming, Wiley, New York, 1994.
16. A. Kolen, Tree network and planar location theory, Center for Mathematics and Computer Science, P.O.Box 4079, 1009 AB Amsterdam, The Netherlands, 1986.
17. P. Kouvelis, G. Vairaktarakis, G. Yu, 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 at Austin.
18. P. Kouvelis, G. Yu, Robust Discrete Optimization and Its Applications, Kluwer Academic Publishers, Boston, 1997.
19. M. Labbe, J.-F. Thisse, R.E. Wendell, Sensitivity analysis in minisum facility location problems, Oper. Res. 39 (6) (1991) 961-969.
20. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
21. N. Meggido, Combinatorial optimization with rational objective functions, Math. Oper. Res. 4 (1979) 414-424.
22. P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley, New York, 1990.
23. R.G. Parker, R.L. Rardin, Guaranteed performance heuristics for bottleneck traveling salesman problem, Oper. Res. Lett. 2 (1984) 269-272.
24. M. Pinedo, Scheduling, Prentice-Hall, New Jersey, 1995.
25. A.P. Punnen, A linear time algorithm for the maximum capacity path problem, Eur. J. Oper. Res. 53 (1991) 402-404.
26. A.P. Punnen, K.P.K. Nair, A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem, Inform. Process. Lett. 50 (1994) 283-286.
27. B. Tansel, G. Yesilkokcen, Polynomially solvable cases of multifacility distance constraints on cyclic networks, ISOLDE-6 Proceedings 1993, pp. 269-273.
28. G. Vairaktarakis, P. Kouvelis, Incorporation dynamic aspects and uncertainty in 1-median location problems, Naval Res. Logistics 46 (1999) 147-168.