Computing and minimizing the relative regret in combinatorial optimization with interval data

Discrete Optimization

Volumn 2, Issue 4, 2005, Pages 273-287

  Averbakh, Igor ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Interval data; Minmax regret optimization; Polynomial algorithm; Robust optimization; Uncertainty

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA REDUCTION; ESTIMATION; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING;

INTERVAL DATA; MINMAX REGRET OPTIMIZATION; POLYNOMIAL ALGORITHMS; ROBUST OPTIMIZATION; UNCERTAINTY;

OPTIMIZATION;

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

References (29)

1. R. Ahuja, T. Magnanti, and J. Orlin Network Flows 1993 Prentice Hall Upper Saddle River, NJ
2. I. Aron, and P. Van Hentenryck On the complexity of the robust spanning tree problem with interval data Oper. Res. Lett. 32 2004 36 40
3. I. Averbakh Minmax regret solutions for minimax optimization problems with uncertainty Oper. Res. Lett. 27 2 2000 57 65
4. I. Averbakh On the complexity of a class of combinatorial optimization problems with uncertainty Math. Programming 90 2001 263 272
5. I. Averbakh, The minmax relative regret median problem on networks, INFORMS J. Comput., to appear.
6. I. Averbakh, and V. Lebedev Interval data minmax regret network optimization problems Discrete Appl. Math. 138 2004 289 301
7. A. Ben-Tal, and A. Nemirovski Robust convex optimization Math. Oper. Res. 23 4 1998 769 805
8. D. Bertsimas, and M. Sim Robust discrete optimization and network flows Math. Programming B 98 2003 43 71
9. K.W. Chong, Y. Han, and T.W. Lam Concurrent threads and optimal parallel minimum spanning trees algorithm J. ACM 48 2 2001 297 323
10. R. Cole Slowing down sorting networks to obtain faster sorting algorithms J. Assoc. Comp. Mach. 34 1987 200 208
11. E. Conde An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion Math. Programming 100 2004 345 353
12. R. Daniels, and P. Kouvelis Robust scheduling to hedge against processing time uncertainty in single-stage production Management Sci. 41 2 1995 363 376
13. O.E. Karasan, M. Pinar, H. Yaman, The robust shortest path problem with interval data, Working Paper, Department of Industrial Engineering, Bilkent University, 06533 Bilkent, Ankara, Turkey, 2001.
14. A. Kasperski, P. Zielinski, Minimizing maximal regret in the linear assignment problems with interval costs, Preprint 007, Instytut Matematyki Politechnika Wroslawska, Wroslaw, Poland, 2004. Available at < http://www.im.pwr.wroc.pl/ ∼ pziel/publications/reports/dam.pdf >.
15. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 1997 Kluwer Academic Publishers Boston
16. V. Lebedev, I. Averbakh, Complexity of minimizing the total flow time with interval data and minmax regret criterion, Discrete Appl. Math., to appear.
17. T.L. Magnanti, and L. Wolsey Optimal trees M.O. Ball Network Models, Handbook in Operations Research and Management Science vol. 7 1995 North-Holland Amsterdam 503 615
18. H. Mausser, and M. Laguna Minimizing the maximum relative regret for linear programmes with interval objective function coefficients J. Oper. Res. Soc. 50 1999 1063 1070
19. N. Megiddo Combinatorial optimization with rational objective functions Math. Oper. Res. 4 1979 414 424
20. N. Megiddo Applying parallel algorithms in the design of serial algorithms J. Assoc. Comp. Mach. 30 1983 852 865
21. R. Montemanni, and L.M. Gambardella A branch-and-bound algorithm for the robust spanning tree problem with interval data European J. Oper. Res. 161 2005 771 779
22. R. Montemanni, L.M. Gambardella, A.E. Rizzoli, and A.V. Donati A branch-and-bound algorithm for the robust shortest path problem with interval data Oper. Res. Lett. 32 2004 225 232
23. J.M. Mulvey, R.J. Vanderbei, and S.A. Zenious Robust optimization of large scale systems Oper. Res. 43 2 1995 264 281
24. Ch.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1982 Prentice Hall Englewood Cliffs, NJ
25. T. Radzik Fractional combinatorial optimization D.-Z. Du P. Pardalos Handbook of Combinatorial Optimization vol. 1 1998 Kluwer Academic Publishers Dordrecht, The Netherlands 429 478
26. J. Reif Synthesis of Parallel Algorithms 1993 Kaufmann Publishers California
27. D.J. Welsh Matroid Theory 1976 Academic Press London
28. H. Yaman, O.E. Karasan, and M.C. Pinar The robust spanning tree problem with interval data Oper. Res. Lett. 29 2001 31 40
29. P. Zielinski The computational complexity of the relative robust shortest path problem with interval data European J. Oper. Res. 158 2004 570 576