A. Agra, M. Christiansen, and A. Delgado, Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem, Transportation Science, vol.47, issue.1, pp.108-124, 2013.
DOI : 10.1287/trsc.1120.0416
URL : https://brage.bibsys.no/xmlui/bitstream/11250/2452881/1/Agra%2bet%2bal%2bMixed%2binteger%2bformulation%2bTS.pdf

A. Agra, M. Christiansen, R. M. Figueiredo, L. M. Hvattum, M. Poss et al., Layered Formulation for the Robust Vehicle Routing Problem with Time Windows, Combinatorial Optimization -Second International Symposium, ISCO 2012, pp.249-260, 2012.
DOI : 10.1007/978-3-642-32147-4_23
URL : https://hal.archives-ouvertes.fr/hal-00777762

A. Agra, M. Christiansen, R. M. Figueiredo, L. M. Hvattum, M. Poss et al., The robust vehicle routing problem with time windows, Computers & Operations Research, vol.40, issue.3, pp.40-856, 2013.
DOI : 10.1016/j.cor.2012.10.002
URL : https://hal.archives-ouvertes.fr/hal-00916976

A. Agra and C. Requejo, The linking set problem: a polynomial special case of the multiple-choice knapsack problem, Journal of Mathematical Sciences, vol.183, issue.4, pp.919-929, 2009.
DOI : 10.1007/978-3-540-24777-7

P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3
URL : https://doi.org/10.1016/s0304-3975(98)00158-3

A. Ardestani-jaafari and E. Delage, Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems, Operations Research, vol.64, issue.2
DOI : 10.1287/opre.2016.1483

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-based scheduling: applying constraint programming to scheduling problems, 2001.
DOI : 10.1007/978-1-4615-1479-4
URL : https://hal.archives-ouvertes.fr/inria-00123562

A. Ben-tal, D. Hertog, and J. Vial, Deriving robust counterparts of nonlinear uncertain inequalities, Mathematical Programming, pp.1-35, 2014.
DOI : 10.1007/s10107-014-0750-8
URL : https://pure.uvt.nl/ws/files/1436907/2012-053.pdf

A. Ben-tal, B. Golany, A. Nemirovski, and J. Vial, Retailer-supplier flexible commitments contracts: A robust optimization approach, Manufacturing & Service Operations Management, pp.248-271, 2005.
DOI : 10.1287/msom.1050.0081
URL : http://www2.isye.gatech.edu/~nemirovs/MSOM_05.pdf

A. Ben-tal and A. Nemirovski, Robust Convex Optimization, Mathematics of Operations Research, vol.23, issue.4, pp.769-805, 1998.
DOI : 10.1287/moor.23.4.769

D. Bertsimas, D. B. Brown, and C. Caramanis, Theory and Applications of Robust Optimization, SIAM Review, vol.53, issue.3, pp.464-501, 2011.
DOI : 10.1137/080734510

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
URL : http://www.bschool.nus.edu/staff/dscsimm/docs/rodiscrete.pdf

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

D. Bienstock and N. Ozbay, Computing robust basestock levels, Discrete Optimization, pp.389-414, 2008.
DOI : 10.1016/j.disopt.2006.12.002
URL : https://doi.org/10.1016/j.disopt.2006.12.002

P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, vol.112, issue.1, pp.3-41, 1999.
DOI : 10.1016/S0377-2217(98)00204-5

A. M. Campbell and B. W. Thomas, Probabilistic Traveling Salesman Problem with Deadlines, Transportation Science, vol.42, issue.1, pp.1-21, 2008.
DOI : 10.1287/trsc.1070.0203

M. Chardy and O. Klopfenstein, Handling uncertainties in vehicle routing problems through data preprocessing, proceedings of the Third International Conference on Information Systems, Logistics and Supply Chain, 2010.
DOI : 10.1016/j.tre.2011.12.001

M. Fischetti and M. Monaci, Cutting plane versus compact formulations for uncertain (integer) linear programs, Mathematical Programming Computation, vol.21, issue.3, pp.239-273, 2012.
DOI : 10.1287/opre.21.5.1154

V. Gabrel, C. Murat, and A. Thiele, Recent advances in robust optimization: An overview, European Journal of Operational Research, vol.235, issue.3, pp.471-483, 2014.
DOI : 10.1016/j.ejor.2013.09.036
URL : https://hal.archives-ouvertes.fr/hal-01495346

B. L. Gorissen, A. Ben-tal, H. Blanc, and D. , Den Hertog, A new method for deriving robust and globalized robust solutions of uncertain linear conic optimization problems having general convex uncertainty sets Online First, Operations Research, 2014.

B. L. Gorissen and D. Hertog, Robust counterparts of inequalities containing sums of maxima of linear functions, European Journal of Operational Research, vol.227, issue.1, pp.30-43, 2013.
DOI : 10.1016/j.ejor.2012.10.007

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1993.

E. Guslitser, Uuncertainty immunized solutions in linear programming, master's thesis, TECHNION-ISRAEL INSTITUTE OF TECHNOLOGY, 2002.

D. A. Iancu, M. Sharma, and M. Sviridenko, Supermodularity and Affine Policies in Dynamic Robust Optimization, Operations Research, vol.61, issue.4, pp.941-956, 2013.
DOI : 10.1287/opre.2013.1172
URL : http://www2.warwick.ac.uk/fac/sci/dcs/people/maxim_sviridenko/supermod_robust.pdf

O. H. Ibarra and C. E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems, Journal of the ACM, vol.22, issue.4, pp.463-468, 1975.
DOI : 10.1145/321906.321909

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

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

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

A. A. Pessoa, L. Di-puglia-pugliese, F. Guerriero, and M. Poss, Robust constrained shortest path problems under budgeted uncertainty, pp.66-98, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01229790

M. Poss, Robust combinatorial optimization with variable cost uncertainty, European Journal of Operational Research, vol.237, issue.3, pp.836-845, 2014.
DOI : 10.1016/j.ejor.2014.02.060
URL : https://hal.archives-ouvertes.fr/hal-01099569

O. Solyali, J. Cordeau, and G. Laporte, Robust Inventory Routing Under Demand Uncertainty, Transportation Science, vol.46, issue.3, pp.327-340, 2012.
DOI : 10.1287/trsc.1110.0387

Z. M. Teksan and J. Geunes, A polynomial time algorithm for convex cost lot-sizing problems, Operations Research Letters, vol.43, issue.4, pp.359-364, 2015.
DOI : 10.1016/j.orl.2015.03.009

B. Zeng and L. Zhao, Solving two-stage robust optimization problems using a column-and-constraint generation method, Operations Research Letters, vol.41, issue.5, pp.457-461, 2013.
DOI : 10.1016/j.orl.2013.05.003