E. Álvarez-miranda, I. Ljubic, and P. Toth, A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems, 4OR, vol.98, issue.4, pp.349-360, 2013.
DOI : 10.1007/s10288-013-0231-6

C. Bentz, M. Costa, N. Derhy, and F. Roupin, Cardinality constrained and multicriteria (multi)cut problems, Journal of Discrete Algorithms, vol.7, issue.1, pp.102-111, 2009.
DOI : 10.1016/j.jda.2008.04.004
URL : https://hal.archives-ouvertes.fr/hal-00596156

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

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

Q. Botton, B. Fortz, L. Gouveia, and M. Poss, Benders Decomposition for the Hop-Constrained Survivable Network Design Problem, INFORMS Journal on Computing, vol.25, issue.1, pp.13-26, 2013.
DOI : 10.1287/ijoc.1110.0472
URL : https://hal.archives-ouvertes.fr/hal-01255255

P. Brucker and S. Knust, Complex scheduling, 2006.
DOI : 10.1007/978-3-642-23929-8

C. Büsing and F. Andreagiovanni, New Results about Multi-band Uncertainty in Robust Optimization, SEA, pp.63-74, 2012.
DOI : 10.1007/978-3-642-30850-5_7

G. Cornuejols and R. Tutuncu, Optimization methods in finance, 2006.
DOI : 10.1017/CBO9780511753886

E. Erdogan and G. Iyengar, Ambiguous chance constrained problems and robust optimization, Mathematical Programming, pp.37-61, 2006.
DOI : 10.1007/s10107-005-0678-0

M. Held and R. M. Karp, A Dynamic Programming Approach to Sequencing Problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.1, pp.196-210, 1962.
DOI : 10.1137/0110015

O. Klopfenstein and D. Nace, A robust approach to the chance-constrained knapsack problem, Operations Research Letters, vol.36, issue.5, pp.628-632, 2008.
DOI : 10.1016/j.orl.2008.03.006

A. M. Koster, M. Kutschka, and C. Raack, Robust network design: Formulations, valid inequalities, and computations, Networks, vol.36, issue.2, pp.128-149, 2013.
DOI : 10.1002/net.21497

C. Lee, K. Lee, K. Park, and S. Park, Technical Note???Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations, Operations Research, vol.60, issue.3, pp.604-610, 2012.
DOI : 10.1287/opre.1120.1049

A. Mahjoub, L. Simonetti, and E. Uchoa, Hop-level flow formulation for the survivable network design with hop constraints problem, Networks, vol.46, issue.2, pp.61-171, 2013.
DOI : 10.1002/net.21483
URL : https://hal.archives-ouvertes.fr/hal-01497005

S. Mattia, Robust optimization with multiple intervals, 2012.

M. Monaci and U. Pferschy, On the Robust Knapsack Problem, SIAM Journal on Optimization, vol.23, issue.4, pp.1956-1982, 2013.
DOI : 10.1137/120880355

M. Monaci, U. Pferschy, and P. Serafini, Exact solution of the robust knapsack problem, Computers & Operations Research, vol.40, issue.11, pp.40-2625, 2013.
DOI : 10.1016/j.cor.2013.05.005

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

G. Righini and M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, vol.3, issue.3, pp.155-170, 2008.
DOI : 10.1002/net.20212

M. Sniedovich, Dynamic programming foundations and principles CRC, 2011.

Z. Ác-?ková and J. , On minimax solution of stochastic linear programming problems. C ? asopis pro Pe ?stování Matematiky, pp.423-430, 1966.

F. B. Zhan and C. E. Noon, Shortest Path Algorithms: An Evaluation Using Real Road Networks, Transportation Science, vol.32, issue.1, pp.65-73, 1998.
DOI : 10.1287/trsc.32.1.65