H. B. Amor, J. Desrosiers, and A. Frangioni, Stabilization in column generation. Groupe d'études et de recherche en analyse des décisions, 2004.

S. B. Salem, Gestion robuste de la production électrique à horizon court terme, 2011.

A. Ben-tal and A. Nemirovski, Robust convex optimization, Mathematics of operations research, vol.23, issue.4, pp.769-805, 1998.

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

J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische mathematik, vol.4, pp.238-252, 1962.

J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische mathematik, vol.4, pp.238-252, 1962.

D. Bertsimas and C. Caramanis, Finite adaptability in multistage linear optimization, IEEE Transactions on Automatic Control, vol.55, issue.12, pp.2751-2766, 2010.

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

D. Bertsimas and J. N. Tsitsiklis, Introduction to linear optimization, Athena Scientific Belmont, vol.6, 1997.

D. Bienstock, M. Chertkov, and S. Harnett, Chance-constrained optimal power flow : Risk-aware network control under uncertainty, Siam Review, vol.56, issue.3, pp.461-495, 2014.

H. Blondel and C. Roblin, Le modele datarrep de placement des arrets pour rechargement des tranches nucleaires rep : Note de principe, 1994.

P. Bonami, Étude et mise en oeuvre d'approches polyédriques pour la résolution de programmes en nombres entiers ou mixtes généraux, 2003.

F. Brandt, Solving a large-scale energy management problem with varied constraints, 2010.

D. Catanzaro, R. Aringhieri, M. D. Summa, and R. Pesenti, A branch-price-and-cut algorithm for the minimum evolution problem, European Journal of Operational Research, vol.244, issue.3, pp.753-765, 2015.

A. Charnes, W. W. Cooper, and G. H. Symonds, Cost horizons and certainty equivalents : an approach to stochastic programming of heating oil, Management Science, vol.4, issue.3, pp.235-263, 1958.

M. Conforti, G. Cornuéjols, and G. Zambelli, Extended formulations in combinatorial optimization, vol.4, pp.1-48, 2010.

I. Contreras, J. F. Cordeau, and G. Laporte, Benders decomposition for large-scale uncapacitated hub location, Operations research, vol.59, issue.6, pp.1477-1490, 2011.

E. T. Coughlan, M. E. Lübbecke, and J. Schulz, A branch-price-and-cut algorithm for multi-mode resource leveling, European Journal of Operational Research, vol.245, issue.1, pp.70-80, 2015.

R. J. Dakin, A tree-search algorithm for mixed integer programming problems, The computer journal, vol.8, issue.3, pp.250-255, 1965.

G. Dantzig, Linear programming and extensions, 2016.

G. B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Operations research, vol.8, issue.1, pp.101-111, 1960.

I. Das and J. E. Dennis, A closer look at drawbacks of minimizing weighted sums of objectives for pareto set generation in multicriteria optimization problems. Structural optimization, vol.14, pp.63-69, 1997.

G. Dereu, Roadef/euro challenge : Final results, 2010.

G. Desaulniers, J. Desrosiers, and M. M. Solomon, Column generation, vol.5, 2006.

G. Desaulniers, J. G. Rakke, and L. C. Coelho, A branch-price-and-cut algorithm for the inventoryrouting problem, Transportation Science, vol.50, issue.3, pp.1060-1076, 2015.

J. Desrosiers and M. E. Lübbecke, Branch-price-and-cut algorithms. Encyclopedia of Operations Research and Management Science, pp.109-131, 2011.

B. Detienne, Extended formulations for robust maintenance planning at power plants, Gaspard Monge Program for Optimization : Conference on Optimization and Practices in Industry PGMOCOPI14, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01104728

B. Detienne, R. Sadykov, H. ?en, and F. Vanderbeck, Revisiting Benders Decomposition, Symposium Combinatorial Optimization and Applications, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01467283

D. Devillaine, Note de principe de la fonction gloabal pi du logiciel orion, 2003.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische mathematik, vol.1, issue.1, pp.269-271, 1959.

J. Ding and A. Somani, A long-term investment planning model for mixed energy infrastructure integrated with renewable energy, Green Technologies Conference, pp.1-10, 2010.

N. Dupin, Modélisation et résolution de grands problèmes stochastiques combinatoires : application à la gestion de production d'électricité, 2015.

N. Dupin and E. Talbi, Dual heuristics and new lower bounds for the challenge euro/roadef 2010, Matheuristics, p.60, 2016.

M. Fischetti and M. Monaci, Light robustness, Robust and online large-scale optimization, pp.61-84, 2009.

M. L. Fisher, The lagrangian relaxation method for solving integer programming problems. Management science, vol.27, pp.1-18, 1981.

L. R. Ford and D. R. Fulkerson, A suggested computation for maximal multi-commodity network flows, Management Science, vol.5, issue.1, pp.97-101, 1958.

F. Fourcade, Formulation lineaire du placement des arrets du nucleaire, 1993.

F. Fourcade, Placement des arrets du nucleaire : Resolution par programmation lineaire en nombres entiers, 1993.

F. Fourcade, T. Eve, and T. Socroun, Optimiser les rechargements des reacteurs nucleaires franÇais, 1995.

F. Fourcade, E. Johnson, M. Bara, and P. Cortey-dumont, Optimizing nuclear power plant refueling with mixed-integer programming, European journal of operational research, vol.97, issue.2, pp.269-280, 1997.

F. Gardi and K. Nouioua, Local search for mixed-integer nonlinear optimization : a methodology and an application, Evolutionary Computation in Combinatorial Optimization, pp.167-178, 2011.

H. Gavranovi? and M. Buljuba?i?, A hybrid approach combining local search and constraint programming for a large scale energy management problem. RAIRO-Operations Research, vol.47, pp.481-500, 2013.

A. M. Geoffrion, Elements of large-scale mathematical programming part i : Concepts, Management Science, vol.16, issue.11, pp.652-675, 1970.

H. Gevret, Documentation artémis, vol.6125, 1910.

S. Godskesen, T. S. Jensen, N. Kjeldsen, and R. Larsen, Solving a real-life, large-scale energy management problem, Journal of Scheduling, vol.16, issue.6, pp.567-583, 2013.

A. Gorge, Programmation semi définie positive : méthodes et algorithmes pour le management d'énergie" Doctorat en mathématiques appliquées, 2010.

Y. Haimes, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE transactions on systems, man, and cybernetics, vol.1, issue.3, pp.296-297, 1971.

J. Han, P. Bendotti, B. Detienne, G. Petrou, M. Porcheron et al., Société française de recherche opérationnelle et d'aide à la décision, ROADEF-15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, 2014.

G. A. Hanasusanto, D. Kuhn, and W. Wiesemann, K-adaptability in two-stage robust binary programming, Operations Research, vol.63, issue.4, pp.877-891, 2015.

W. D. Harvey and M. L. Ginsberg, Limited discrepancy search, IJCAI (1), pp.607-615, 1995.

C. Joncour, Problèmes de placement 2D et application à l'ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique, 2011.

V. Jost and D. Savourey, A 0-1 integer linear programming approach to schedule outages of nuclear power plants, Journal of Scheduling, vol.16, issue.6, pp.551-566, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00920446

V. Kaibel, Extended formulations in combinatorial optimization, 2011.

M. Khemmoudj, Modélisation et résolution de systèmes de contraintes :application au problème de placement des arrêts et de la production des réacteurs nucléaires d'EDF, 2007.

G. Laporte and F. V. Louveaux, The integer l-shaped method for stochastic integer programs with complete recourse, Operations research letters, vol.13, issue.3, pp.133-142, 1993.

E. L. Lawler and D. E. Wood, Branch-and-bound methods : A survey, Operations research, vol.14, issue.4, pp.699-719, 1966.

M. A. Lejeune and A. Ruszczy?ski, An efficient trajectory method for probabilistic productioninventory-distribution problems, Operations Research, vol.55, issue.2, pp.378-394, 2007.

Z. Li and Z. Li, Chance constrained planning and scheduling under uncertainty using robust optimization approximation, IFAC-PapersOnLine, vol.48, issue.8, pp.1156-1161, 2015.

C. Lim, Relationship among b enders, d antzig-w olfe, and l agrangian optimization. Wiley Encyclopedia of Operations Research and Management Science, 2010.

M. E. Lübbecke, Column generation. Wiley Encyclopedia of Operations Research and Management Science, 2010.

M. E. Lübbecke and J. Desrosiers, Selected topics in column generation, Operations research, vol.53, issue.6, pp.1007-1023, 2005.

R. Lusby, L. F. Muller, and B. Petersen, A solution approach to the roadef/euro 2010 challenge based on benders decomposition. Shortest Paths and Vehicle Routing, p.201, 2010.

R. T. Marler and J. S. Arora, The weighted sum method for multi-objective optimization : new insights. Structural and multidisciplinary optimization, vol.41, pp.853-862, 2010.

D. R. Morrison, S. H. Jacobson, J. J. Sauppe, and E. C. Sewell, Branch-and-bound algorithms : A survey of recent advances in searching, branching, and pruning. Discrete Optimization, vol.19, pp.79-102, 2016.

H. Nguyen and . Chau, Pprd orion note de principe sur l'algorithme du modèle global avec planning initial, 1998.

W. Oliveira, C. Sagastizábal, and S. Scheimberg, Inexact bundle methods for two-stage stochastic programming, SIAM Journal on Optimization, vol.21, issue.2, pp.517-544, 2011.
DOI : 10.1137/100808289
URL : http://www.optimization-online.org/DB_FILE/2010/09/2729.pdf

M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM review, vol.33, issue.1, pp.60-100, 1991.

J. Peekstok and E. Kuipers, Roadef/euro 2010 challenge, 2010.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, In-out separation and column generation stabilization by dual price smoothing, International Symposium on Experimental Algorithms, pp.354-365, 2013.
DOI : 10.1007/978-3-642-38527-8_31
URL : https://hal.archives-ouvertes.fr/hal-00750412

R. Pira and C. Wolfer-calvo, Column and row generation for stochastic optimization, 2015.

M. Porcheron, A. Gorge, O. Juan, T. Simovic, and G. Dereu, Challenge roadef/euro 2010 : A large-scale energy management problem with varied constraints, 2010.

A. Prékopa, Probabilistic programming. Handbooks in operations research and management science, vol.10, pp.267-351, 2003.

M. Ribeiro, G. Desaulniers, and J. Desrosiers, A branch-price-and-cut algorithm for the workover rig routing problem, Computers & Operations Research, vol.39, issue.12, pp.3305-3315, 2012.

P. Roussel, Optimisation du planning de rechargement d'un parc de réacteurs p.w.r. le modèle planum, 1981.

A. Rozenknop, R. Wolfer-calvo, L. Alfandari, D. Chemla, and L. Létocart, Solving the electricity production planning problem by a column generation based heuristic, Journal of Scheduling, vol.16, issue.6, pp.585-604, 2013.
DOI : 10.1007/s10951-012-0286-9

R. Sadykov, F. Vanderbeck, A. Pessoa, I. Tahiri, and E. Uchoa, Primal heuristics for branch-andprice, 2015.

J. Salmeron, K. Wood, and R. Baldick, Worst-case interdiction analysis of large-scale electric power grids, IEEE Transactions on power systems, vol.24, issue.1, pp.96-104, 2009.
DOI : 10.1109/tpwrs.2008.2004825
URL : https://calhoun.nps.edu/bitstream/10945/36728/1/SalmeronWoodBaldick2009.pdf

H. ?en, Cut generation based algorithms for unrelated parallel machine scheduling problems, 2015.

A. L. Soyster, Convex programming with set-inclusive constraints and applications to inexact linear programming, Operations research, vol.21, issue.5, pp.1154-1157, 1973.

S. Spoorendonk, Cut and column generation, 2008.

A. Subramanyam, C. E. Gounaris, and W. Wiesemann, K-adaptability in two-stage mixed-integer robust optimization, 2017.

M. Tahanan, W. Van-ackooij, A. Frangioni, and F. Lacalandra, Large-scale unit commitment under uncertainty, vol.4, pp.115-171, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01340333

Z. C. Ta?kin, Benders decomposition. Wiley Encyclopedia of Operations Research and Management Science, 2010.

F. Vanderbeck and L. A. Wolsey, Reformulation and decomposition of integer programs, 50 Years of Integer Programming, pp.431-502, 1958.
URL : https://hal.archives-ouvertes.fr/inria-00392254

H. Wang and M. Song, Ckmeans. 1d. dp : optimal k-means clustering in one dimension by dynamic programming, The R journal, vol.3, issue.2, p.29, 2011.

W. Wiesemann, D. Kuhn, and M. Sim, Distributionally robust convex optimization, Operations Research, vol.62, issue.6, pp.1358-1376, 2014.

R. Wolfer-calvo, Optimizing the electricity production planning with stochastic outage durations, 2018.

L. Zadeh, Optimality and non-scalar-valued performance criteria, IEEE transactions on Automatic Control, vol.8, issue.1, pp.59-60, 1963.

C. Zhao and Y. Guan, Unified stochastic and robust unit commitment, IEEE Transactions on Power Systems, vol.28, issue.3, pp.3353-3361, 2013.