. Wim-van-ackooij and . Edf-r&d,

J. Boeck, Graphes et optimisation mathématique

M. Poss, UMR CNRS 5506 LIRMM, p.34392

, We will formulate a general stylized model that can, in principle, account for a variety of management questions such as unit-commitment. The resulting model, a bilevel stochastic mixed integer program will be numerically tackled through a novel preprocessing procedure. As a result the solution for the bilevel (or single leader multiple follower) problem will be neither "optimistic" nor "pessimistic

, Integer programming, power generation, bilevel optimization, stochastic optimization, single leader multiple follower games

L. Adam, R. Henrion, and J. Outrata, On M-stationarity conditions in MPECs and the associated qualification conditions, Mathematical Programming, vol.168, issue.1, pp.229-259, 2018.

R. K. Ahuja, O. Ergun, J. B. Orlin, and A. P. Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1, pp.75-102, 2002.

U. Al-turki, C. Fedjki, and A. Andijani, Tabu search for a class of single-machine scheduling problems, Computers & Operations Research, vol.28, issue.12, pp.1223-1230, 2001.

S. M. Al-yakoob and H. D. Sherali, A Column Generation Approach for an Employee Scheduling Problem with Multiple Shifts and Work Locations, The Journal of the Operational Research Society, vol.59, issue.1, pp.34-43, 2008.

H. K. Alfares, Survey, Categorization, and Comparison of Recent Tour Scheduling Literature, Annals of Operations Research, vol.127, issue.1-4, pp.145-175, 2004.

G. E. Asimakopoulou, A. L. Dimeas, and N. D. Hatziargyriou, Leader-Follower Strategies for Energy Management of Multi-Microgrids, IEEE Transactions on Smart Grid, vol.4, issue.4, pp.1909-1916, 2013.

D. Aussel, P. Bendotti, and M. Pi?t?k, Nash equilibrium in a pay-as-bid electricity market: Part 1 existence and characterization. Optimization, vol.66, pp.1013-1025, 2017.

D. Aussel, P. Bendotti, and M. Pi?t?k, Nash equilibrium in a pay-as-bid electricity market Part 2 -best response of a producer, Optimization, vol.66, issue.6, pp.1027-1053, 2017.

T. Aykin, Optimal Shift Scheduling with Multiple Break Windows, Management Science, vol.42, issue.4, pp.591-602, 1996.

T. Aykin, A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows, Journal of the Operational Research Society, vol.49, issue.6, pp.603-615, 1998.

J. Bailey, Integrated days off and shift personnel scheduling, Computers & Industrial Engineering, vol.9, issue.4, pp.395-404, 1985.

K. R. Baker, Workforce Allocation in Cyclical Scheduling Problems: A Survey, Operational Research Quarterly, vol.27, issue.1, pp.155-167, 1970.

E. Balas and M. C. Carrera, A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering, Operations Research, vol.44, issue.6, pp.875-890, 1996.

E. Balas and M. Padberg, Set Partitioning: A survey, SIAM Review, vol.18, issue.4, pp.710-760, 1976.

R. Baldacci, N. Christofides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, issue.2, pp.351-385, 2008.

R. Baldacci, E. Bartolini, A. Mingozzi, and R. Roberti, An exact solution framework for a broad class of vehicle routing problems, Computational Management Science, vol.7, issue.3, pp.229-268, 2010.

R. Baldacci, E. Bartolini, and A. Mingozzi, An Exact Algorithm for the Pickup and Delivery Problem with Time Windows, Operations Research, vol.59, issue.2, pp.414-426, 2011.

R. Baldacci, E. Bartolini, A. Mingozzi, and A. Valletta, An Exact Algorithm for the Period Routing Problem, Operations Research, vol.59, issue.1, pp.228-241, 2011.

R. Baldacci, S. U. Ngueveu, and R. Wolfler-calvo, The Vehicle Routing Problem with Transhipment Facilities, Transportation Science, vol.51, issue.2, pp.592-606, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01880025

R. Baldacci, A. Hill, E. A. Hoshino, and A. Lim, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, European Journal of Operational Research, vol.262, issue.3, pp.879-893, 2017.

M. L. Balinski and R. E. Quandt, On an Integer Program for a Delivery Problem, Operations Research, vol.12, issue.2, pp.300-304, 1964.

F. Barahona and R. , On some difficult linear programs coming from set partitioning, Discrete Applied Mathematics, vol.118, issue.12, pp.3-11, 2002.

J. F. Bard and J. T. Moore, An algorithm for the discrete bilevel programming problem, Naval Research Logistics (NRL), vol.39, issue.3, pp.419-435, 1992.

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.

S. E. Bechtold and L. W. Jacobs, Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling, Management Science, vol.36, issue.11, pp.1339-1351, 1990.

S. E. Bechtold and L. W. Jacobs, The equivalence of general set-covering and implicit integer programming formulations for shift scheduling, Naval Research Logistics (NRL), vol.43, issue.2, pp.233-249, 1996.

M. Boschetti and V. Maniezzo, A set covering based matheuristic for a real-world city logistics problem, International Transactions in Operational Research, vol.22, issue.1, pp.169-195, 2015.

M. A. Boschetti, A. Mingozzi, and S. Ricciardelli, A dual ascent procedure for the set partitioning problem, Discrete Optimization, vol.5, issue.4, pp.735-747, 2008.

M. A. Boschetti, V. Maniezzo, M. Roffilli, and A. Bolufé-röhler, Matheuristics: Optimization, Simulation and Control, Hybrid Metaheuristics, pp.171-177, 2009.

V. Boyer, B. Gendron, and L. Rousseau, A branch-and-price algorithm for the multiactivity multi-task shift scheduling problem, Journal of Scheduling, vol.17, issue.2, pp.185-197, 2013.

G. Brønmo, B. Nygreen, and J. Lysgaard, Column generation approaches to ship scheduling with flexible cargo sizes, European Journal of Operational Research, vol.200, issue.1, pp.139-150, 2010.

J. O. Brunner and J. F. Bard, Flexible weekly tour scheduling for postal service workers using a branch and price, Journal of Scheduling, vol.16, issue.1, pp.129-149, 2013.

M. J. Brusco and L. W. Jacobs, A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems, The Journal of the Operational Research Society, vol.44, issue.12, pp.1191-1200, 1993.

M. J. Brusco and L. W. Jacobs, Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling, Management Science, vol.46, issue.12, pp.1630-1641, 2000.

E. K. Burke, P. D. Causmaecker, S. Petrovic, and G. V. Berghe, Metaheuristics for handling time interval coverage constraints in nurse scheduling, Applied Artificial Intelligence, vol.20, issue.9, pp.743-766, 2006.

V. Cacchiani, V. C. Hemmelmayr, and F. Tricoire, A set-covering based heuristic algorithm for the periodic vehicle routing problem, Discrete Applied Mathematics, vol.163, pp.53-64, 2014.

M. Carrión and J. M. Arroyo, A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem, IEEE Transactions on Power Systems, vol.21, issue.3, pp.1371-1378, 2006.

S. Ceria, P. Nobili, and A. Sassano, A lagrangian-based heuristic for large-scale set covering problems, Mathematical Programming, vol.81, issue.2, pp.215-228, 1998.

S. Ceria, P. Nobili, and A. Sassano, A Lagrangian-based heuristic for large-scale set covering problems, Mathematical Programming, vol.81, issue.2, pp.215-228, 1998.

C. Cervilla, J. Villar, and F. A. Campos, Bi-level optimization of electricity tariffs and PV distributed generation investments, 12th International Conference on the European Energy Market (EEM), pp.1-5, 2015.

M. Chiarandini, A. Schaerf, and F. Tiozzo, Solving employee timetabling problems with flexible workload using tabu search, Proceedings of the 3 rd Int. Conf. on the Practice and Theory of Automated Timetabling, pp.298-302, 2000.

M. Côté, B. Gendron, C. Quimper, and L. Rousseau, Formal languages for integer programming modeling of shift scheduling problems, Constraints, vol.16, issue.1, pp.54-76, 2011.

M. Côté, B. Gendron, and L. Rousseau, Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling, Management Science, vol.57, issue.1, pp.151-163, 2011.

M. Côté, B. Gendron, and L. Rousseau, Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling, INFORMS Journal on Computing, vol.25, issue.3, pp.461-474, 2013.

S. Dahmen and M. Rekik, Solving Multi-activity Multi-day Shift Scheduling Problems with a Hybrid Heuristic, J. of Scheduling, vol.18, issue.2, pp.207-223, 2015.

S. Dahmen, M. Rekik, and F. Soumis, An implicit model for multi-activity shift scheduling problems, Journal of Scheduling, vol.21, issue.3, pp.285-304, 2018.

G. B. Dantzig, Letter to the EditorA Comment on Edie's "Traffic Delays at Toll Booths, Journal of the Operations Research Society of America, vol.2, issue.3, pp.339-341, 1954.

G. B. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960.

K. Darby-dowman and G. Mitra, An extension of set partitioning with application to scheduling problems, European Journal of Operational Research, vol.21, issue.2, pp.200-205, 1985.

P. De-bruecker, J. Van-den, J. Bergh, E. Belien, and . Demeulemeester, A tabu search heuristic for building aircraft maintenance personnel rosters, Available at SSRN 2464033, 2014.

V. L. De-matos, D. P. Morton, and E. C. Finardi, Assessing policy quality in a multistage stochastic program for long-term hydrothermal scheduling, Annals of Operations Research, vol.253, issue.2, pp.713-731, 2017.

S. Demassey, G. Pesant, and L. Rousseau, Constraint Programming Based Column Generation for Employee Timetabling, pp.140-154, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00293565

S. Demassey, G. Pesant, and L. Rousseau, A Cost-Regular Based Hybrid Column Generation Approach, Constraints, vol.11, issue.4, pp.315-333, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00293562

S. Dempe and J. Dutta, Is bilevel programming a special case of a mathematical program with complementarity constraints? Mathematical Programming, vol.131, pp.37-48, 2012.

S. Dempe, V. Kalashnikov, G. A. Prez-valds, and N. Kalashnykova, Bilevel Programming Problems: Theory, Algorithms and Applications to Energy Networks. Energy Systems, 2015.

G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux et al., Crew pairing at Air France, European Journal of Operational Research, vol.97, issue.2, pp.245-259, 1997.

G. Desaulniers, J. Desrosiers, and M. M. Solomon, Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems, Essays and Surveys in Metaheuristics, pp.309-324, 2002.

J. Desrosiers and M. E. Lübbecke, A Primer in Column Generation, Column Generation, pp.1-32, 2005.

F. F. Easton and D. F. Rossin, Sufficient Working Subsets for the Tour Scheduling Problem, Management Science, vol.37, issue.11, pp.1441-1451, 1991.

L. C. Edie, Traffic Delays at Toll Booths, Journal of the Operations Research Society of America, vol.2, issue.2, pp.107-138, 1954.

A. T. Ernst, H. Jiang, M. Krishnamoorthy, B. Owens, and D. Sier, An Annotated Bibliography of Personnel Scheduling and Rostering, Annals of Operations Research, vol.127, issue.1-4, pp.21-144, 2004.

A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, Staff scheduling and rostering: A review of applications, methods and models, European Journal of Operational Research, vol.153, issue.1, pp.3-27, 2004.

F. Facchinei and J. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research and Financial Engineering, Finite-Dimensional Variational Inequalities and Complementarity Problems: Volume I, 2003.

F. Facchinei and J. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer Series in Operations Research and Financial Engineering, Finite-Dimensional Variational Inequalities and Complementarity Problems: Volume II, 2003.

R. Fernández-blanco, J. M. Arroyo, N. Alguacil, and X. Guan, Incorporating Price-Responsive Demand in Energy Scheduling Based on Consumer Payment Minimization, IEEE Transactions on Smart Grid, vol.7, issue.2, pp.817-826, 2016.

M. Fischetti, I. Ljubi?, M. Monaci, and M. Sinnl, Intersection Cuts for Bilevel Optimization, Integer Programming and Combinatorial Optimization, pp.77-88, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01666294

M. L. Fisher and P. Kedia, Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics, Management Science, vol.36, issue.6, pp.674-688, 1990.

F. Furini, E. Malaguti, S. Martin, and I. Ternier, ILP Models and Column Generation for the Minimum Sum Coloring Problem, Electronic Notes in Discrete Mathematics, vol.64, pp.215-224, 2018.

M. Gamache, F. Soumis, G. Marquis, and J. Desrosiers, A Column Generation Approach for Large-Scale Aircrew Rostering Problems, Operations Research, vol.47, issue.2, pp.247-263, 1999.

L. D. Gaspero, J. Grtner, N. Musliu, A. Schaerf, W. Schafhauser et al., A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem, Hybrid Metaheuristics, pp.46-61, 2010.

L. D. Gaspero, J. Grtner, N. Musliu, A. Schaerf, W. Schafhauser et al., Automated Shift Design and Break Scheduling, Automated Scheduling and Planning, pp.109-127, 2013.

M. Gérard, F. Clautiaux, and R. Sadykov, Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce, European Journal of Operational Research, vol.252, issue.3, pp.1019-1030, 2016.

F. Glover, Tabu search-part i, ORSA Journal on computing, vol.1, issue.3, pp.190-206, 1989.

S. Hao and F. Zhuang, New models for integrated short-term forward electricity markets, IEEE Transactions on Power Systems, vol.18, issue.2, pp.478-485, 2003.

A. Haurie, R. Loulou, and G. Savard, A two-player game model of power cogeneration in New England, IEEE Transactions on Automatic Control, vol.37, issue.9, pp.1451-1456, 1992.

S. Held, W. Cook, and E. C. Sewell, Maximum-weight stable sets and safe lower bounds for graph coloring, Mathematical Programming Computation, vol.4, issue.4, pp.363-381, 2012.

R. Henrion, J. Outrata, and T. Surowiec, Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market. ESAIM: Control, Optimisation and Calculus of Variations, vol.18, pp.295-317, 2012.

N. A. Hernández-leandro, V. Boyer, M. A. Salazar-aguilar, and L. Rousseau, A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem, European Journal of Operational Research, 2018.

B. Heymann and A. Jofré, Mechanism Design and Auctions for Electricity Network, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01315844

B. F. Hobbs and S. K. Nelson, A nonlinear bilevel model for analysis of electric utility demand-side planning issues, Annals of Operations Research, vol.34, issue.1, pp.255-274, 1992.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, And Computation, 2006.

D. Huisman, R. Jans, M. Peeters, and A. P. Wagelmans, Combining Column Generation and Lagrangian Relaxation, Column Generation, pp.247-270, 2005.

S. Irnich and G. Desaulniers, Shortest Path Problems with Resource Constraints, Column Generation, pp.33-65, 2005.

L. W. Jacobs and M. J. Brusco, Overlapping Start-Time Bands in Implicit Tour Scheduling, Management Science, vol.42, issue.9, pp.1247-1259, 1996.

Y. Jin, J. Hamiez, and J. Hao, Algorithms for the minimum sum coloring problem: a review, Artificial Intelligence Review, vol.47, issue.3, pp.367-394, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01412512

E. G. Kardakos, C. K. Simoglou, and A. G. Bakirtzis, Optimal Offering Strategy of a Virtual Power Plant: A Stochastic Bi-Level Approach, IEEE Transactions on Smart Grid, vol.7, issue.2, pp.794-806, 2016.

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

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

R. M. Lusby, J. Larsen, M. Ehrgott, and D. Ryan, Railway track allocation: models and methods, OR Spectrum, vol.33, issue.4, pp.843-883, 2011.

E. Malaguti, M. Monaci, and P. Toth, An exact approach for the Vertex Coloring Problem, Discrete Optimization, vol.8, issue.2, pp.174-190, 2011.

A. Mehrotra, K. E. Murphy, and M. A. Trick, Optimal shift scheduling: A branch-and-price approach, Naval Research Logistics (NRL), vol.47, issue.3, pp.185-200, 2000.

A. Meisels and A. Schaerf, Modelling and Solving Employee Timetabling Problems, Annals of Mathematics and Artificial Intelligence, vol.39, issue.1-2, pp.41-59, 2003.

A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco, An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation, Management Science, vol.44, issue.5, pp.714-729, 1998.

A. Mohsenian-rad, V. W. Wong, J. Jatskevich, R. Schober, and A. Leon-garcia, Autonomous Demand-Side Management Based on Game-Theoretic Energy Consumption Scheduling for the Future Smart Grid, IEEE Transactions on Smart Grid, vol.1, issue.3, pp.320-331, 2010.

J. A. Momoh and L. Mili, Economic Market Design and Planning for Electric Power Systems, 2009.

J. T. Moore and J. F. Bard, The Mixed Integer Linear Bilevel Programming Problem, Operations Research, vol.38, issue.5, pp.911-921, 1990.

N. Musliu, A. Schaerf, and W. Slany, Local search for shift design, European Journal of Operational Research, vol.153, issue.1, pp.51-64, 2004.

I. Muter, ?. ?. Birbil, and G. ?ahin, Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems, INFORMS Journal on Computing, vol.22, issue.4, pp.603-619, 2010.

P. J. Neame, Nonsmooth Dual Methods in Integer Programming, 1999.

J. V. Outrata, On the numerical solution of a class of Stackelberg problems, Z. Operations Research, vol.34, issue.4, pp.255-277, 1990.

J. Pang and M. Fukushima, Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games, Computational Management Science, vol.2, issue.1, pp.21-56, 2005.

J. Pang and M. Fukushima, Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games, Computational Management Science, vol.6, issue.3, pp.373-375, 2009.

J. Pang, M. Razaviyayn, and A. Alvarado, Computing B-Stationary Points of, Nonsmooth DC Programs. Mathematics of Operations Research, vol.42, issue.1, pp.95-118, 2016.

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, pp.482-495, 2004.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, Automation and combination of linear-programming based stabilization techniques in column generation, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01077984

E. Prescott-gagnon, G. Desaulniers, and L. Rousseau, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Networks, vol.54, issue.4, pp.190-204, 2009.

C. Quimper and L. Rousseau, A large neighbourhood search approach to the multiactivity shift scheduling problem, Journal of Heuristics, vol.16, issue.3, pp.373-392, 2009.

M. S. Rasmussen and J. Larsen, Optimisation-Based Solution Methods for Set Partitioning Models, 2011.

M. Rekik, J. Cordeau, and F. Soumis, Implicit shift scheduling with multiple breaks and work stretch duration restrictions, Journal of Scheduling, vol.13, issue.1, pp.49-75, 2010.

M. I. Restrepo, L. Lozano, and A. L. Medaglia, Constrained network-based column generation for the multi-activity shift scheduling problem, International Journal of Production Economics, vol.140, issue.1, pp.466-472, 2012.

M. I. Restrepo, B. Gendron, and L. Rousseau, Branch-and-Price for Personalized Multiactivity Tour Scheduling, INFORMS Journal on Computing, vol.28, issue.2, pp.334-350, 2016.

M. I. Restrepo, B. Gendron, and L. Rousseau, Combining Benders decomposition and column generation for multi-activity tour scheduling, Computers & Operations Research, vol.93, pp.151-165, 2018.

N. J. Rezanova and D. M. Ryan, The train driver recovery problemA set partitioning based model and solution method, Computers & Operations Research, vol.37, issue.5, pp.845-856, 2010.

G. Righini and M. Salani, Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006.

R. T. Rockafellar, Solving Stochastic Programming Problems with Risk Measures by Progressive Hedging. Set-Valued and Variational Analysis, 2017.

R. T. Rockafellar and S. Uryasev, Optimization of Conditional Value-at-Risk, Journal of Risk, vol.2, pp.21-41, 2000.

R. T. Rockafellar and S. Uryasev, The fundamental risk quadrangle in risk management, optimization and statistical estimation, vol.18, pp.33-53, 2013.

M. Rönnqvist, A method for the cutting stock problem with different qualities, European Journal of Operational Research, vol.83, issue.1, pp.57-68, 1995.

S. Ropke and D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.40, issue.4, pp.455-472, 2006.

F. Rossi and S. Smriglio, A set packing model for the ground holding problem in congested networks, European Journal of Operational Research, vol.131, issue.2, pp.400-416, 2001.

R. Sadykov, F. Vanderbeck, A. Pessoa, I. Tahiri, and E. Uchoa, Primal Heuristics for Branch-and-Price: the assets of diving methods, INFORMS Journal on Computing, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01237204

A. Shapiro, On complexity of multistage stochastic programs, Operations Research Letters, vol.34, issue.1, pp.1-8, 2006.

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, pp.417-431, 1998.

T. Surowiec, Explicit stationarity conditions and solution characterization for equilibrium problems with equilibrium constraints, 2010.

M. Tahanan, W. Van-ackooij, F. Antonio, and F. Lacalandra, Large-scale Unit Commitment under uncertainty: a literature survey, vol.4, pp.115-171, 2015.

R. Taktak and C. , An overview on mathematical programming approaches for the deterministic unit commitment problem in hydro valleys, Energy Systems, vol.8, issue.1, pp.57-79, 2017.

G. M. Thompson, Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem, Management Science, vol.41, issue.4, pp.595-607, 1995.

G. M. Thompson, Labor scheduling: A commentary. The Cornell Hotel and Restaurant Administration Quarterly, vol.44, pp.149-155, 2003.

N. Touati-moungla, L. Létocart, and A. Nagih, Solutions diversification in a column generation algorithm, Algorithmic Operations Research, vol.5, issue.2, pp.86-95, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00522354

W. Van-ackooij and W. De-oliveira, DC programming techniques with inexact subproblems' solution for general DC programs, pp.1-27, 2017.

J. Van-den, J. Bergh, P. Belin, . De, E. Bruecker et al., Personnel scheduling: A literature review, European Journal of Operational Research, vol.226, issue.3, pp.367-385, 2013.

F. Vanderbeck, Implementing Mixed Integer Column Generation, Column Generation, pp.331-358, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00342630

F. Vanderbeck and L. A. Wolsey, An exact algorithm for IP column generation, Operations Research Letters, vol.19, issue.4, pp.151-159, 1996.

R. R. Vemuganti, Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey, Handbook of Combinatorial Optimization, pp.573-746, 1998.

P. J. Zwaneveld, L. G. Kroon, H. E. Romeijn, M. Salomon, S. Dauzère-pérès et al., Routing Trains Through Railway Stations: Model Formulation and Algorithms, Transportation Science, vol.30, issue.3, pp.181-194, 1996.