Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization

Volumn 7, Issue 3, 2010, Pages 181-190

  Averbakh, Igor ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Bottleneck problems; Data uncertainty; Minmax regret optimization; Polynomial algorithm; Robust optimization

Indexed keywords

BOTTLENECK PROBLEM; DATA UNCERTAINTY; MINMAX REGRET OPTIMIZATION; POLYNOMIAL ALGORITHM; ROBUST OPTIMIZATION;

ALGORITHMS; BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; PROFITABILITY; UNCERTAINTY ANALYSIS;

POLYNOMIALS;

EID: 78751585229     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.03.007     Document Type: Article

References (26)

1. H. Aissi, C. Bazgan, and D. Vanderpooten Complexity of the minmax and minmax regret assignment problem Operations Research Letters 33 6 2005 634 640
2. I. Aron, and P. Van Hentenryck On the complexity of the robust spanning tree problem with interval data Operations Research Letters 32 2004 36 40
3. I. Averbakh Minmax regret solutions for minimax optimization problems with uncertainty Operations Research Letters 27 2 2000 57 65
4. I. Averbakh On the complexity of a class of combinatorial optimization problems with uncertainty Mathematical Programming 90 2001 263 272
5. I. Averbakh, and V. Lebedev Interval data minmax regret network optimization problems Discrete Applied Mathematics 138 2004 289 301
6. E. Conde An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion Mathematical Programming 100 2004 345 353
7. E. Conde On the complexity of the continuous unbounded knapsack problem with uncertain coefficients Operations Research Letters 33 5 2005 481 485
8. E. Conde, and A. Candia Minmax regret spanning arborescences under uncertain costs European Journal of Operational Research 182 2 2007 561 577
9. O.E. Karasan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, Technical Report, Bilkent University, Turkey, 2001.
10. A. Kasperski, and P. Zielinski An approximation algorithm for interval data minmax regret combinatorial optimization problems Information Processing Letters 97 5 2006 177 180
11. A. Kasperski, and P. Zielinski The robust shortest path problem in seriesparallel multigraphs with interval data Operations Research Letters 34 1 2006 69 76
12. A. Kasperski, and P. Zielinski On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data Operations Research Letters 34 1 2007 525 532
13. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 1997 Kluwer Academic Publ. Boston
14. R. Montemanni, and L.M. Gambardella A branch and bound algorithm for the robust spanning tree problem with interval data European Journal of Operational Research 161 2005 771 779
15. R. Montemanni A Benders decomposition approach for the robust spanning tree problem with interval data European Journal of Operational Research 174 3 2006 1479 1490
16. H. Yaman, O.E. Karasan, and M.C. Pinar The robust spanning tree problem with interval data Operations Research Letters 29 2001 31 40
17. H. Yaman, O.E. Karasan, and M.C. Pinar Restricted robust uniform matroid maximization under interval uncertainty Mathematical Programming 110 2007 431 441
18. P. Zielinski The computational complexity of the relative robust shortest path problem with interval data European Journal of Operational Research 158 2004 570 576
19. A. Ben-Tal, and A. Nemirovski Robust convex optimization Mathematics of Operations Research 23 4 1998 769 805
20. D. Bertsimas, and M. Sim Robust discrete optimization and network flows Mathematical Programming, Series B 98 2003 43 71
21. L. El-Ghaoui, F. Oustry, and H. Lebret Robust solutions to uncertain semidefinite programs SIAM Journal on Optimization 9 1998 33 52
22. J.M. Mulvey, R.J. Vanderbei, and S.A. Zenious Robust optimization of large scale systems Operations Research 43 2 1995 264 281
23. I. Averbakh, and Y. Zhao Explicit reformulations for robust optimization problems with general uncertainty sets SIAM Journal on Optimization 18 4 2008 1436 1466
24. D.J. Welsh Matroid Theory 1976 Academic Press London
25. A. Aho, J. Hopcroft, and J. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Publishing Company Reading, MA
26. R. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice Hall Upper Saddle River, NJ