A. Ben-tal and A. Nemirovski, Robust solutions of Linear Programming problems contaminated with uncertain data, Mathematical Programming, vol.88, issue.3, pp.411-424, 2000.
DOI : 10.1007/PL00011380

D. Bertsimas and M. Sim, The Price of Robustness, Operations Research, vol.52, issue.1, pp.35-53, 2004.
DOI : 10.1287/opre.1030.0065

M. Poss, Robust combinatorial optimization with variable budgeted uncertainty, 4OR, vol.59, issue.1, pp.75-92, 2013.
DOI : 10.1002/net.20488
URL : https://hal.archives-ouvertes.fr/hal-00916975

H. Aissi, C. Bazgan, and D. , Vanderpooten, Min?max and min?max regret versions of combinatorial optimization problems: A survey, pp.427-438, 2009.

P. Kouvelis and G. Yu, Robust discrete optimization and its applications, 2013.
DOI : 10.1007/978-1-4757-2620-6

M. Sim, Robust optimization, 2004.

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical Programming, vol.98, issue.1-3, pp.49-71, 2003.
DOI : 10.1007/s10107-003-0396-4

E. Alvarez-miranda, I. Ljubic, and P. Toth, A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems, 4OR, vol.98, issue.4, pp.4-11, 2013.
DOI : 10.1007/s10107-003-0396-4

K. Goetzmann, S. Stiller, and C. Telha, Optimization over Integers with Robustness in Cost and Few Constraints, pp.89-101, 2011.
DOI : 10.1007/978-3-642-29116-6_8

E. Nikolova, Approximation Algorithms for Reliable Stochastic Combinatorial Optimization, pp.338-351, 2010.
DOI : 10.1007/978-3-642-15369-3_26
URL : http://theory.csail.mit.edu/%7Eenikolova/papers/reliable.pdf

S. Mokarami and S. M. Hashemi, Constrained shortest path with uncertain transit times, Journal of Global Optimization, vol.45, issue.10, pp.149-163, 2015.
DOI : 10.1016/j.trb.2011.06.004

A. Atamtürk and V. Narayanan, Polymatroids and mean-risk minimization in discrete optimization, Operations Research Letters, vol.36, issue.5, pp.618-622, 2008.
DOI : 10.1016/j.orl.2008.04.006

F. Baumann, C. Buchheim, and A. Ilyina, Lagrangean decomposition for meanvariance combinatorial optimization, pp.62-74, 2014.
DOI : 10.1007/978-3-319-14115-2_6

F. Babonneau, J. Vial, O. Klopfenstein, and A. Ouorou, Robust capacity assignment solutions for telecommunications networks with uncertain demands, Networks, vol.3, issue.4, pp.255-272, 2013.
DOI : 10.1007/BF02110042

A. A. Pessoa and M. Poss, Robust Network Design with Uncertain Outsourcing Cost, INFORMS Journal on Computing, vol.27, issue.3, pp.507-524, 2015.
DOI : 10.1287/ijoc.2015.0643
URL : https://hal.archives-ouvertes.fr/hal-01229787

M. Minoux, On robust maximum flow with polyhedral uncertainty sets, Optimization Letters, vol.4, issue.1, pp.367-376, 2009.
DOI : 10.1007/s11590-009-0116-y
URL : https://hal.archives-ouvertes.fr/hal-01170357

M. Minoux, Solving some multistage robust decision problems with huge implicitly defined scenario trees, Algorithmic Operations Research, vol.4, issue.1, pp.1-18, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01170185

B. Tadayon and J. C. Smith, Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems, Journal of Scheduling, vol.6, issue.1, pp.575-592, 2015.
DOI : 10.1023/A:1013333232691

C. E. Gounaris, P. P. Repoussis, C. D. Tarantilis, W. Wiesemann, and C. A. Floudas, An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem, Transportation Science, vol.50, issue.4, pp.1239-1260, 2016.
DOI : 10.1287/trsc.2014.0559

C. E. Gounaris, W. Wiesemann, and C. A. Floudas, The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty, Operations Research, vol.61, issue.3, pp.677-693, 2013.
DOI : 10.1287/opre.1120.1136

J. A. Fingerhut, S. Suri, and J. S. Turner, Designing Least-Cost Nonblocking Broadband Networks, Journal of Algorithms, vol.24, issue.2, pp.287-309, 1997.
DOI : 10.1006/jagm.1997.0866
URL : http://www.cs.ucsb.edu/~suri/psdir/atm.ps

A. Alt?n, E. Amaldi, P. Belotti, and M. P?nar, Provisioning virtual private networks under traffic uncertainty, Networks, vol.21, issue.1, pp.100-115, 2007.
DOI : 10.1002/net.20145

D. Bienstock, Histogram models for robust portfolio optimization, The Journal of Computational Finance, vol.11, issue.1, 2007.
DOI : 10.21314/JCF.2007.168
URL : http://www.columbia.edu/~dano/papers/rqp.pdf

O. Nohadani and K. Sharma, Optimization under decision-dependent uncertainty , arXiv preprint

M. Bougeret, A. A. Pessoa, and M. Poss, Robust scheduling with budgeted uncertainty, available at https