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

E. Alvarez-miranda, I. Ljubi´cljubi´c, and P. Toth, A note on the bertsimas & sim algorithm for robust combinatorial optimization problems, vol.4, pp.349-360, 2013.

J. E. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks, vol.19, issue.4, pp.379-394, 1989.

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs, Operations Research Letters, vol.25, pp.1-13, 1999.

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical Programming, vol.98, pp.49-71, 2003.

D. Bertsimas and M. Sim, The price of robustness, Operations Research, vol.52, pp.35-53, 2004.

C. Büsing, A. M. Koster, and M. Kutschka, Recoverable robust knapsacks: ?-scenarios, Network Optimization -5th International Conference, INOC 2011, pp.583-588, 2011.

W. M. Carlyle, J. O. Royset, and R. K. Wood, Lagrangian relaxation and enumeration for solving constrained shortest-path problems, Networks, vol.52, issue.4, pp.256-270, 2008.

L. , D. Puglia-pugliese, and F. Guerriero, A reference point approach for the resource constrained shortest path problems, Transportation Science, vol.47, issue.2, pp.247-265, 2013.

L. , D. Puglia-pugliese, and F. Guerriero, A survey of resource constrained shortest path problems: Exact solution approaches, Networks, vol.62, issue.3, pp.183-200, 2013.

I. Dumitrescu and N. Boland, Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks, vol.42, pp.135-153, 2003.

A. Elimam and D. Kohler, Two engineering applications of a constrained shortest-path model, European Journal of Operational Research, vol.103, issue.3, pp.426-438, 1997.

K. Goetzmann, S. Stiller, and C. Telha, Optimization over integers with robustness in cost and few constraints, WAOA, pp.89-101, 2011.

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.

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.

J. Halpern and I. Priess, Shortest path with time constraints on movement and parking, vol.4, pp.241-253, 1974.

O. Klopfenstein and D. Nace, A robust approach to the chance-constrained knapsack problem, Oper. Res. Lett, vol.36, issue.5, pp.628-632, 2008.

C. Lee, K. Lee, K. Park, and S. Park, Technical note -branch-and-priceand-cut approach to the robust network design problem without flow bifurcations, Operations Research, vol.60, issue.3, pp.604-610, 2012.

C. Lee, K. Lee, and S. Park, Robust vehicle routing problem with deadlines and travel time/demand uncertainty, Journal of the Operational Research Society, vol.63, issue.9, pp.1294-1306, 2012.

T. Lee and C. Kwon, A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty, vol.4, pp.373-378, 2014.

L. Lozano and A. Medaglia, On an exact method for the constrained shortest path problem, Computers & Operations Research, vol.40, pp.278-284, 2013.

D. Lu, Robust optimization for airline scheduling and vehicle routing, 2014.

D. Lu and F. Gzara, The robust crew pairing problem: model and solution methodology, Journal of Global Optimization, vol.62, issue.1, pp.29-54, 2015.

D. Lu and F. Gzara, Models and algorithms for the robust resource constrained shortest path problem, 2018.

K. Mehlhorn and M. Ziegelmann, Resource constraint shortest paths, 8 th Ann Eur Symp on Algorithms (ESA2000), vol.1879, pp.326-337, 2000.

S. Mokarami and S. M. Hashemi, Constrained shortest path with uncertain transit times, Journal of Global Optimization, vol.63, issue.1, pp.149-163, 2015.
DOI : 10.1007/s10898-015-0280-9

M. Monaci, U. Pferschy, and P. Serafini, Exact solution of the robust knapsack problem, Computers & OR, vol.40, issue.11, pp.2625-2631, 2013.

F. Ordónez, Robust vehicle routing, TUTORIALS in Operations Research, pp.153-178, 2010.

A. Pessoa, M. Poss, R. Sadykov, and F. Vanderbeck, Branch-and-cut-andprice for the robust capacitated vehicle routing problem with knapsack uncertainty, 2018.

A. A. Pessoa, L. D. Pugliese, F. Guerriero, and M. Poss, Robust constrained shortest path problems under budgeted uncertainty, Networks, vol.66, issue.2, pp.98-111, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01229790

M. Poss, Robust combinatorial optimization with variable budgeted uncertainty, vol.4, pp.75-92, 2013.
DOI : 10.1007/s10288-012-0217-9

URL : https://hal.archives-ouvertes.fr/hal-00916975

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

M. Poss, Robust combinatorial optimization with knapsack uncertainty, Discrete Optimization, vol.27, pp.88-102, 2018.
DOI : 10.1016/j.disopt.2017.09.004

URL : https://hal.archives-ouvertes.fr/hal-01444717

U. Ritzinger, J. Puchinger, and R. F. Hartl, A survey on dynamic and stochastic vehicle routing problems, International Journal of Production Research, vol.54, issue.1, pp.215-231, 2016.
DOI : 10.1080/00207543.2015.1043403

URL : https://hal.archives-ouvertes.fr/hal-01224562

L. Santos, J. Coutinho-rodrigues, and J. R. Current, An improved solution algorithm for the constrained shortest path problem, Transport Res BMeth, vol.41, issue.7, pp.756-771, 2007.

M. C. Santos, A. Agra, M. Poss, and D. Nace, A dynamic programming approach for a class of robust optimization problems, SIAM Journal on Optimization, vol.3, pp.1799-1823, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01348688

A. Sedeno-noda and S. Alonso-rodriguez, An enhanced k-sp algorithm with pruning strategies to solve the constrained shortest path problem, Applied Mathematics and Computation, vol.265, pp.602-618, 2015.

I. Sungur, F. O. , and M. Dessouky, A robust optimization approach for the capacitated vehicle routing, IIE Transactions, vol.40, issue.5, pp.509-523, 2008.
DOI : 10.1080/07408170701745378

L. Wang, L. Yang, and Z. Gao, The constrained shortest path problem with stochastic correlated link travel times, European Journal of Operational Research, vol.255, issue.1, pp.43-57, 2016.

G. Xue, Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees, Performance, Computing, and Communications Conference, pp.271-277, 2000.

M. Zabarankin, S. Uryasev, and P. Pardalos, Optimal risk path algorithms. Applied Optimization, vol.66, pp.273-296, 2002.
DOI : 10.1007/0-306-47536-7_13