Robust combinatorial optimization with variable budgeted uncertainty

4OR

Volumn 11, Issue 1, 2013, Pages 75-92

  Poss, Michael ^a,b  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Chance constraint; Combinatorial optimization; Multifunction; Robust optimization; Variable uncertainty

Indexed keywords

EID: 84874369251     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-012-0217-9     Document Type: Article

References (13)

1. Agra A, Christiansen M, Figueiredo R, Hvattum LM, Poss M, Requejo C (2012) The robust vehicle routing problem with time windows. Comput OR (in press).
2. Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25: 1-13.
3. Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program 88: 411-424.
4. Ben-Tal A, Nemirovski A (2002) Robust optimization methodology and applications. Math Program 92: 453-480.
5. Ben-Tal A, Ghaoui LE, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton.
6. Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52: 35-53.
7. Birge JR, Louveaux FV (2011) Introduction to stochastic programming, 2nd edn. Springer, New York.
8. Burer S, Letchford A (2012) Non-convex mixed-integer nonlinear programming: a survey. Surv Oper Res Manage Sci. http://www. lancs. ac. uk/staff/letchfoa/articles/minlp-survey. pdf (submitted).
9. Erdogan E, Iyengar G (2006) Ambiguous chance constrained problems and robust optimization. Math Program 107: 37-61.
10. Fortz B, Labbé M, Louveaux FV, Poss M (2012) Stochastic binary problems with simple penalties for capacity constraints violations. Math Program (in press).
11. IBM (2012) IBM-ILOG Cplex optimizer.
12. Kleywegt AJ, Shapiro A, de Mello TH (2002) The sample average approximation method for stochastic discrete optimization. SIAM J Optim 12(2): 479-502.
13. Klopfenstein O, Nace D (2012) Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem. Networks 59(1): 59-72.