Restricted robust uniform matroid maximization under interval uncertainty

Mathematical Programming

Volumn 110, Issue 2, 2007, Pages 431-441

  Yaman, H ^a   Karasan O E ^a   Pinar, M C ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Interval data; Robust optimization; Uniform matroid

Indexed keywords

FUNCTION EVALUATION; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

INTERVAL DATA; MODELING POWER; ROBUST OPTIMIZATION; UNIFORM MATROID;

MATRIX ALGEBRA;

EID: 33947686734     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0008-1     Document Type: Article

References (16)

1. Aron, I.D., Van Hentenryck, P.: On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32: 36-40 (2004)
2. Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Prog. 90:263-272 (2001)
3. Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. OR. 23: 769-805 (1998)
4. Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms and engineering applications. SIAM-MPS, Philadelphia (2000)
5. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Prog. B 98: 49-71 (2003)
6. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52: 35-53 (2004)
7. Conde, E.: An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Math. Prog. 100: 345-353 (2004)
8. El-Ghaoui, L., Lebret, H.: Robust solutions to least squares problems under uncertain data matrices. SIAM J. Matrix Anal. Appl. 18:1035-1064 (1997)
9. Kouvelis, P., Yu, G.: Robust discrete optimization and applications. Kluwer, Boston (1997)
10. Mausser, H.E., Laguna, M.: A new mixed integer formulation for the maximum regret problem. Int. Trans. Oper. Res. 5(5): 389-403 (1998)
11. Montemanni, R., Gambardella, L.M.: A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161: 771-729 (2005)
12. Montemanni, R., Gambardella, L.M., Donati, A.V.: A branch and bound for the robust shortest path problem with interval data. Oper. Res. Lett. 32: 225-232 (2004)
13. Schrijver, A.: Theory of linear and integer programming. Wiley, New York (1987)
14. Yaman, H., Karacan, O.E., Pmar, M.Ç.: The robust spanning tree problem with interval data. Oper. Res. Lett. 29: 31-40 (2001)
15. Yaman, H., Karasan, O.E., Pmar, M.Ç.: Restricted robust optimization for maximization over uniform matroid with interval data uncertainty. Technical report, Bilkent University, Ankara, Turkey, www.ie.bilkent.edu.tr/~mustafap/pubs/psecrev.pdf (2005)
16. Zielinski, P.: The computational complexity of the relative robust short path problem with interval data. Eur. J. Oper. Res. 158: 570-576 (2004)