G. Bonvin, S. Demassey, C. Le-pape, V. Mazauric, N. Maïzi et al., html Profil Scholar : http://scholar.google.com/citations? A mathematical programming approach of pump scheduling for load management in branched water networks, Publications Les publications sont téléchargeables en ligne, pp.1702-1711, 2017.

N. Beldiceanu, M. Carlsson, S. Demassey, and E. Poder, New filtering for the cumulative constraint in the context of non-overlapping rectangles, Annals of Operations Research, vol.118, issue.1???4, pp.27-50, 2011.
DOI : 10.1023/A:1021801522545
URL : https://hal.archives-ouvertes.fr/hal-00481541

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalog : past, present and future, Constraints, special issue on global constraints, pp.21-62, 2007.

S. Demassey, G. Pesant, and L. Rousseau, A cost-regular based hybrid column generation approach, Constraints, article invité, version étendue de, pp.315-333, 2006.
DOI : 10.1007/s10601-006-9003-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.325.4875

S. Demassey, C. Artigues, . Ph, and . Michelon, Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem, INFORMS Journal on Computing, vol.17, issue.1, pp.52-65, 2005.
DOI : 10.1287/ijoc.1030.0043
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9288

. Ph, S. Baptiste, and . Demassey, Tight LP bounds for Resource Constrained Project Scheduling, OR Spectrum, vol.26, issue.2, pp.251-262, 2004.

G. Hermenier, A. Giuliani, S. Milani, and . Demassey, Scaling Energy Adaptive Applications for Sustainable Profitability, Conférences internationales avec sélection et actes proceedings of the 23rd International European Conference on Parallel and Distributed Computing (Euro-Par'17), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01550335

G. Bonvin, A. Samperio, C. Le-pape, V. Mazauric, S. Demassey et al., A Heuristic Approach to the Water Networks Pumping Scheduling Issue, proceedings of the 7th International Conference on Applied Energy (ICAE'15), pp.2846-2851, 2015.
DOI : 10.1016/j.egypro.2015.07.569
URL : https://hal.archives-ouvertes.fr/hal-01158960

G. Chabert and S. Demassey, The Conjunction of Interval Among Constraints, proceedings of the 9th International Conference on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR'12), pp.113-128, 2012.
DOI : 10.1007/978-3-642-29828-8_8
URL : https://hal.archives-ouvertes.fr/hal-00760044

F. Hermenier, S. Demassey, and X. Lorca, Bin Repacking Scheduling in Virtualized Datacenters, proceedings of the 17th International Conference on Principle and Practice of Constraint Programming, pp.27-41, 2011.
DOI : 10.1007/978-3-642-23786-7_5
URL : https://hal.archives-ouvertes.fr/hal-00684764

A. Merel, X. Gandibleux, and S. Demassey, A collaborative combination between column generation and ant colony optimization for solving set packing problems, proceedings of the 9th Metaheuristics International Conference, 2011.

J. Menana and S. Demassey, Sequencing and Counting with the multicost-regular Constraint, proceedings of the 6th International Conference on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR'09), pp.178-192, 2009.
DOI : 10.1007/978-3-642-01929-6_14
URL : https://hal.archives-ouvertes.fr/hal-00394434

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Graph Properties Based Filtering, proceedings of the 12th International Conference on Principle and Practice of Constraint Programming (CP'06), pp.59-74, 2006.
DOI : 10.1007/11889205_7
URL : https://hal.archives-ouvertes.fr/hal-00481579

S. Demassey, G. Pesant, and L. Rousseau, Constraint Programming Based Column Generation for Employee Timetabling, proceedings of the 2nd International Conference on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR'05), pp.140-154, 2005.
DOI : 10.1007/11493853_12
URL : https://hal.archives-ouvertes.fr/hal-00293565

S. Demassey, F. Hermenier, and V. Kherbache, Chapitre Dynamic Packing with Side Constraints for Datacenter Resource Management du livre Optimized Packings and Their Applications, G. Fasano et, 2015.
DOI : 10.1007/978-3-319-18899-7_2

C. Artigues, S. Demassey, and E. Néron, Resource-Constrained Project Scheduling : models, algorithms, extensions and applications, 2008.
DOI : 10.1002/9780470611227
URL : https://hal.archives-ouvertes.fr/hal-00482946

S. Demassey, Chapitre 3 Mathematical programming formulations and lower bounds for the RCPSP du livre Resource-Constrained Project Scheduling : Models, Algorithms, 2008.

E. Néron, C. Artigues, . Ph, J. Baptiste, S. Carlier et al., Chapitre 7 Lower bounds computation for RCPSP du livre Perspectives in modern project scheduling, International Series in Operations Research and Management Science, pp.167-204, 2006.

C. Artigues and S. Demassey, Chapitre 5 Ordonnancement de projet du livre Gestion de la production et ressources humaines, Presses Internationales Polytechnique, 2005.

A. Merel, X. Gandibleux, S. Demassey, and R. Lusby, An improved upper bound for the Railway Infrastructure Capacity Problem on the Pierrefitte-Gonesse junction, actes longs du 10ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'09), pp.62-76, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00466933

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Filtrage basé sur des propriétés de graphes, 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), pp.25-34, 2006.

S. Demassey and F. Hermenier, BtrPlace : Flexible VM Management in Data Centers, Manifestations internationales avec actes à diffusion restreinte Conference on Optimization & Practices in Industry (PGMO-COPI'14, p.3, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01095958

A. Merel, X. Gandibleux, and S. Demassey, Assessing railway infrastructure capacity by solving the saturation problem with an improved column generation algorithm, IAROR Conference : 4th International Seminar on Railway Operations Modelling and Analysis, 2011.

A. Merel, X. Gandibleux, and S. Demassey, Towards a realistic evaluation of Railway Infrastructure Capacity, 9th World Congress on Railway Research (WCRR'11), 2011.

S. Demassey, C. Artigues, . Ph, . Baptiste, . Ph et al., Lagrangean relaxation for the RCPSP, proceedings of the 9th International Workshop on Project Management and Scheduling (PMS'04), pp.380-384, 2004.

S. Demassey, C. Artigues, . Ph, and . Michelon, A hybrid constraint propagation-cutting plane algorithm for the RCPSP, in proceedings of the 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR'02), pp.321-331, 2002.

S. Demassey, C. Artigues, . Ph, and . Michelon, Comparing lower bounds for the RCPSP under a same hybrid constraint-linear programming approach, proceedings of the International Workshop on Cooperative Solvers in Constraint Programming (CoSolv'01) held in conjunction with the International Conference on Constraint Programming (CP'01), pp.109-123, 2001.

S. Demassey, C. Artigues, . Ph, and . Michelon, A new LP based lower bound for the RCPSP, 5th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP'01), 2001.

G. Bonvin and S. Demassey, Relaxation convexe pour la planification de pompage dans les réseaux de distribution d'eau potable, 18ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'17), 2017.

G. Bonvin and S. Demassey, Convex Relaxation for Water Distribution Systems, 28th European Conference on Operational Research, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01441681

A. Havel and S. Demassey, Robust Optimisation for a Smart Grid, 28th European Conference on Operational Research, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01485501

G. Bonvin and S. Demassey, Relaxation convexe pour la planification du pompage dans un réseau branché de distribution d'eau, 17ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'16), 2016.

G. Bonvin and S. Demassey, Energy efficiency in water supply systems : variable speed drives vs pumping scheduling, 27th European Conference on Operational Research (EURO'15), 2015.

S. Demassey and D. Feillet, Hybridation de programmation linéaire et de programmation par contraintes pour le problème de déplacement de conteneurs, 16ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'15), 2015.

X. Libeaut, S. Demassey, J. E. Mendoza, and É. Pinson, Problème de multiflots dynamiques avec contraintes de synchronisation de ressources, 13ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'12), 2012.

A. Merel, X. Gandibleux, and S. Demassey, Vers la prise en compte d'un critère d'équité dans l'évaluation de la capacité d'infrastructures ferroviaires, 13ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'12), 2012.

J. Menana and S. Demassey, Weighted automata, constraint programming, and large neighborhood search, Nurse Rostering Competition at the 8th International Conference for the Practice and Theory of Automated Timetabling (PATAT'10), 2010.

A. Merel, S. Demassey, and X. Gandibleux, Un algorithme de génération de colonnes pour le problème de capacité d'infrastructure ferroviaire, 11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'10), 2010.

J. Menana, S. Demassey, and N. Jussien, Relaxation lagrangienne pour le filtrage d'une contrainteautomate à coûts multiples, 10ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'09), 2009.

S. Demassey, G. Pesant, and L. Rousseau, Constraint programming based column generation for employee timetabling, Optimization Days, JOPT'05), 2005.
DOI : 10.1007/11493853_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.7003

T. Garaix, C. Artigues, and S. Demassey, Bornes basées sur les ensembles interdits pour le problème d'ordonnancement de projet à moyens limités, 6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'05), 2005.

S. Demassey, Resolution search : intelligent backtracking for the RCPSP, 17th European Conference on Combinatorial Optimization, 2004.

S. Demassey, S. Gueye, . Ph, C. Michelon, and . Artigues, Application de resolution search au RCPSP, École d'Automne de Recherche Opérationnelle (EARO'03), 2003.

C. Artigues, S. Demassey, . Ph, and . Michelon, A hybrid constraint propagation-cutting plane procedure for the RCPSP, International Conference on Operations Research (OR'02), 2002.

S. Demassey, C. Artigues, . Ph, and . Michelon, Bornes inférieures pour le RCPSP : une approche hybride PPC/PL, 4ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'02), 2002.

. Ph, S. Michelon, C. Demassey, and . Artigues, Bornes inférieures pour le RCPSP : une approche hybride PPC/PL, 3ème Conférence Internationale de Recherche Opérationnelle (CIRO'02), 2002.

S. Demassey and C. , Borne inférieure pour le problème d'ordonnancement de projet à contraintes de ressources, 3èmes Journées Francophones de Recherche Opérationnelle (Francoro'01), 2001.

C. Artigues, S. Demassey, . Ph, and . Michelon, A linear programming based approach for resource constrained project scheduling, International Symposium on Mathematical Programming (ISMP'00), 2000.

S. Demassey, Resolution Search and intelligent backtrackings, 2005.

S. Demassey, Méthodes hybrides PL/PPC pour la résolution exacte des problèmes combinatoires difficiles, 2005.

S. Demassey, Resolution search et backtrackings intelligents, 2005.

S. Demassey, Resolution search et backtrackings intelligents, pp.5-2003, 2003.

. Mémoires, Méthodes hybrides de programmation par contraintes et de programmation linéaire pour le problème d'ordonnancement de projet à contraintes de ressources, 2003.

S. Demassey, Borne inférieure pour l'ordonnancement de projet à moyens limités, mémoire de DEA Informatique -Optimisation Combinatoire, 2000.

S. Demassey, Élasticité dans les anneaux de Dedekind, 1998.

T. Bibliographieach+16, . Achterberg, E. Robert, Z. Bixby, E. Gu et al., Presolve reductions in mixed integer programming. Rapp. tech, p.67, 2016.

A. Achterberg, SCIP: solving constraint integer programs, Mathematical Programming Computation, vol.29, issue.2, pp.1-41, 2009.
DOI : 10.1287/ijoc.6.4.445
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.7376

I. Aron, N. John, . Hooker, H. Tallys, . «. Yunes et al., SIMPL: A??System for Integrating Optimization Techniques, AI) and Operations Research (OR) Techniques in Constraint Programming, pp.21-36, 2004.
DOI : 10.1007/978-3-540-24664-0_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.3908

H. Reif-andersen, T. Hadzic, N. John, P. Hooker, and . Tiedemann, A Constraint Store Based on Multivalued Decision Diagrams, Principles and Practice of Constraint Programming, pp.118-132, 2007.
DOI : 10.1007/978-3-540-74970-7_11

[. Barnhart, L. Ellis, . Johnson, L. George, . Nemhauser et al., Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.197.7390

[. Beldiceanu and M. Carlsson, Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint, LNCS, pp.377-391, 2001.
DOI : 10.1007/3-540-45578-7_26

D. Bergman, A. Andre, and . Cire, Decomposition Based on Decision Diagrams, pp.45-54, 2016.
DOI : 10.1007/978-3-319-33954-2_4

D. Bergman, A. Andre, W. Cire, and . Van-hoeve, Improved Constraint Propagation via Lagrangian Decomposition, Principles and Practice of Constraint Programming, pp.30-38, 2015.
DOI : 10.1007/978-3-319-23219-5_3

D. Bergman, A. Andre, W. Cire, and . Van-hoeve, Lagrangian bounds from decision diagrams, Constraints, vol.38, issue.12, pp.346-361, 2015.
DOI : 10.1007/3-540-45586-8_4

[. Beldiceanu, M. Carlsson, and J. Rampon, Global constraint catalog, pp.47-52
URL : https://hal.archives-ouvertes.fr/hal-00485457

[. Beldiceanu, M. Carlsson, R. Debruyne, and T. Petit, Reformulation of Global Constraints Based on Constraints Checkers, Constraints [Bel+06] Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey et Thierry Petit. « Graph properties based filtering ». In : Principles and Practice of Constraint Programming
DOI : 10.1007/s10601-005-2809-x

[. Beldiceanu, « Contraintes globales : aspects algorithmiques et déclaratifs ». Habilitation à diriger des recherches, pp.10-55, 2003.

P. Benchimol, W. Van-hoeve, J. Régin, L. Rousseau, and M. Rueher, Improved filtering for weighted circuit constraints, Constraints, vol.26, issue.4, pp.205-233, 2012.
DOI : 10.1145/322154.322161
URL : https://hal.archives-ouvertes.fr/hal-01344070

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

]. C. Bes+05a, E. Bessière, B. Hebrard, Z. Hnich, T. Kiziltan et al., « Among, Common and Disjoint Constraints, CSCLP : Recent Advances in Constraints. T. 3978. Lecture Notes in Computer Science, pp.29-43, 2005.

]. C. Bes+05b, E. Bessière, B. Hebrard, Z. Hnich, T. Kiziltan et al., « The Range and Roots Constraints : Specifying Counting and Occurrence Problems, International Joint Conference on Artificial Intelligence, pp.60-65, 2005.

D. Bergman, W. Van-hoeve-et-john, and N. Hooker, Manipulating MDD Relaxations for Combinatorial Optimization, pp.20-35, 2011.
DOI : 10.1007/978-3-642-21311-3_5
URL : http://ba.gsia.cmu.edu/jnh/relaxation_mdd-finaldraft.pdf

[. Boland, M. Fischetti, M. Monaci, and M. Savelsbergh, Proximity Benders: a decomposition heuristic for stochastic programs, Journal of Heuristics, vol.21, issue.2, pp.181-198, 2016.
DOI : 10.1007/3-540-49481-2_30

G. Bonvin, S. Demassey, C. L. Pape, N. Maïzi, V. Mazauric et al., A convex mathematical program for pump scheduling in a class of branched water networks, Applied Energy, vol.185, pp.1702-1711, 2017.
DOI : 10.1016/j.apenergy.2015.12.090
URL : https://hal.archives-ouvertes.fr/hal-01255929

H. Matthew, . Bassett, F. Joseph, . Pekny, V. Gintaras et al., « Decomposition techniques for the solution of large-scale scheduling problems, AIChE Journal, vol.4212, pp.3373-3387, 1996.

[. Bessiere and J. Régin, « Arc consistency for general constraint networks : preliminary results, International Joint Conference on Artificial Intelligence, p.55, 1997.

]. S. Bra+07, N. Brand, C. G. Narodytska, P. Quimper, T. Stuckey et al., « Encodings of the sequence constraint, Principles and Practice of Constraint Programming. T. 4741. Lecture Notes in Computer Science, pp.210-224, 2007.

K. Edmund, . Burke, R. Mathew, G. Hyde, G. Kendall et al., « Exploring hyper-heuristic methodologies with genetic programming, pp.177-201, 2009.

A. Caprara, P. Toth, D. Vigo, and M. Fischetti, Modeling and Solving the Crew Rostering Problem, Operations Research, vol.46, issue.6, pp.820-830, 1998.
DOI : 10.1287/opre.46.6.820
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4684

[. Chabert and S. Demassey, The Conjunction of Interval Among Constraints, LNCS, vol.25, pp.113-128, 2012.
DOI : 10.1007/978-3-642-29828-8_8
URL : https://hal.archives-ouvertes.fr/hal-00760044

M. Côté, B. Gendron, and L. Rousseau, « Grammarbased integer programming models for multiactivity shift scheduling, Management Science, vol.571, pp.151-163, 2011.

M. Côté, B. Gendron, and L. Rousseau, « Grammarbased column generation for personalized multi-activity shift scheduling, INFORMS Journal on Computing, vol.253, pp.461-474, 2013.

[. Chu, G. Gange, J. Peter, and . Stuckey, Lagrangian Decomposition via Sub-problem Search, pp.65-80, 2016.
DOI : 10.1007/978-3-319-33954-2_6

Y. Caseau and F. Laburthe, « Solving Small TSPs with Constraints, pp.104-64

[. Clark, K. Fraser, S. Hand, J. G. Hansen, E. Jul et al., « Live Migration of Virtual Machines, Networked Systems Design & Implementation -Volume 2. NSDI'05, pp.273-286, 2005.

[. Cambazard, O. Barry, and . Sullivan, Propagating the Bin Packing Constraint Using Linear Programming, Principles and Practice of Constraint Programming, pp.129-136, 2010.
DOI : 10.1007/978-3-642-15396-9_13

[. Cambazard and B. Penz, A Constraint Programming Approach for the Traveling Purchaser Problem, Principles and Practice of Constraint Programming, pp.735-749, 2012.
DOI : 10.1007/978-3-642-33558-7_53
URL : https://hal.archives-ouvertes.fr/hal-00790829

[. Carlier and E. Pinson, « a practical use of Jackson's preemptive schedule for solving the job shop problem, » In : Annals of Operations Research, vol.26, p.53, 1990.

E. Danna, Performance variability in mixed integer programming. Presentation slides from MIP workshop in New York City, p.64, 2008.

B. George and . Dantzig, « Letter to the Editor : A Comment on Edie's "Traffic Delays at Toll Booths, ». In : Journal of the Operations Research Society of America, vol.23, pp.339-341, 1954.

J. Gregory, L. D. Duck, . Koninck, J. Peter, and . Stuckey, « Cadmium : An implementation of ACD term rewriting, International Conference on Logic Programming, pp.531-545, 2008.

[. Desrochers, J. Desrosiers, and M. Solomon, A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows, Operations Research, vol.40, issue.2, pp.342-354, 1992.
DOI : 10.1287/opre.40.2.342

S. «. Demassey, Méthodes hybrides de programmation par contraintes et programmation linéaire pour le probleme d'ordonnancement de projeta contraintes de ressources, Thèse de doctorat. Université d'Avignon et des Pays de Vaucluse, 2003.

J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis, « Time constrained routing and scheduling, Handbooks in operations research and management science, pp.35-139, 1995.
DOI : 10.1016/s0927-0507(05)80106-9

S. Demassey and D. Feillet, « Hybridation de programmation linéaire et de programmation par contraintes pour le problème de déplacement de conteneurs ». In : ROADEF'15-16ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, pp.2015-63

S. Demassey, F. Hermenier, and V. Kherbache, Optimization and Its Applications 105 Dynamic Packing with Side Constraints for Datacenter Resource Management (cf, Optimized Packings and Their Applications, p.14, 2015.
DOI : 10.1007/978-3-319-18899-7_2

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

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

+. Du, D. Merle, J. Villeneuve, P. Desrosiers, and . Hansen, « Stabilized column generation, Discrete Mathematics, vol.194, pp.1-3, 1999.

B. George, P. Dantzig, and . Wolfe, « Decomposition principle for linear programs, pp.101-111, 1960.

[. Epping and D. Frank, VMware vSphere 4.1 HA and DRS technical deepdive, p.17, 2010.

A. Eremin and M. Wallace, Hybrid Benders Decomposition Algorithms in Constraint Logic Programming, pp.1-15, 2001.
DOI : 10.1007/3-540-45578-7_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.9769

[. Fontaine and P. Van-hentenryck, Constraint-Based Lagrangian Relaxation, Principles and Practice of Constraint Programming, pp.324-339, 2014.
DOI : 10.1007/978-3-319-10428-7_25

[. Jr, R. Delbert, and . Fulkerson, « A suggested computation for maximal multi-commodity network flows, Management Science, vol.51, pp.97-101, 1958.

[. França and . Luna, Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition, Transportation Science, vol.16, issue.2, pp.113-126, 1982.
DOI : 10.1287/trsc.16.2.113

[. Focacci, A. Lodi, and M. Milano, « Optimization-oriented global constraints, pp.351-365, 2002.

A. [. Focacci, M. Lodi, and . Milano, Cost-Based Domain Filtering, Principles and Practice of Constraint Programming ?CP'99, pp.189-203, 1999.
DOI : 10.1007/978-3-540-48085-3_14

[. Fischetti, I. Ljubí-c, and M. Sinnl, Redesigning Benders Decomposition for Large-Scale Facility Location, Management Science, vol.63, issue.7, p.5, 2016.
DOI : 10.1287/mnsc.2016.2461

[. Fontaine and L. Michel, A High Level Language for Solver Independent Model Manipulation and Generation of Hybrid Solvers, AI) and Operations Research (OR) Techniques in Constraint Programming, pp.180-194, 2012.
DOI : 10.1007/978-3-642-29828-8_12

M. Alan, W. Frisch, C. Harvey, B. Jefferson, I. Martínez-hernández et al., « Essence : A constraint language for specifying combinatorial problems, pp.268-306, 2008.

R. Michael, . Garey, L. Ronald, . Graham, S. David et al., « Resource constrained scheduling as generalized bin packing, Journal of Combinatorial Theory, Series A 21, pp.257-298, 1976.

M. Arthur and . Geoffrion, « Lagrangean relaxation for integer programming » In : Approaches to integer programming, pp.82-114, 1974.

[. Gamrath, E. Marco, and . Lübbecke, Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs, International Symposium on Experimental Algorithms, pp.239-252, 2010.
DOI : 10.1007/978-3-642-13193-6_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.3579

[. Gellermann, M. Sellmann, and R. Wright, Shorter Path Constraints for the Resource Constrained Shortest Path Problem, AI) and Operations Research (OR) Techniques in Constraint Programming, pp.201-216, 2005.
DOI : 10.1007/11493853_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.2420

[. Hadzic, N. John, . Hooker, O. Barry, P. Sullivan et al., Approximate Compilation of Constraints into Multivalued Decision Diagrams, pp.448-462, 2008.
DOI : 10.1007/978-3-540-85958-1_30
URL : http://ba.gsia.cmu.edu/jnh/nodesplitting.pdf

[. Hermenier, S. Demassey, and X. Lorca, Bin Repacking Scheduling in Virtualized Datacenters -Back to Work Rapport technique : addendum, p.14, 2011.
DOI : 10.1007/978-3-642-23786-7_5

E. John, R. Hopcroft, . Motwani, D. Jeffrey, and . Ullman, Introduction to automata theory, languages, and computation, pp.29-47, 2001.

N. John, G. Hooker, and . Ottosson, « Logic-based Benders decomposition », In : Mathematical Programming, vol.961, pp.33-60, 2003.

M. Hoàng-hà, C. Quimper, and L. Rousseau, « General bounding mechanism for constraint programs, Principles and Practice of Constraint Programming, pp.158-172, 2015.

[. Hoda, W. Van-hoeve-et-john, and N. Hooker, A Systematic Approach to MDD-Based Constraint Programming, pp.266-280, 2010.
DOI : 10.1007/978-3-642-15396-9_23
URL : http://ba.gsia.cmu.edu/jnh/mdd-v7.pdf

N. John, H. Hooker, and . Yan, « A relaxation of the cumulative constraint, Principles and Practice of Constraint Programming, pp.686-691, 2002.

R. Ramaswamy, . Iyer, E. Ignacio, and . Grossmann, « A bilevel decomposition algorithm for long-range planning of process networks, Industrial & Engineering Chemistry Research, vol.372, pp.474-481, 1998.

[. Junker, S. E. Karisch, N. Kohl, and B. Vaaben, Torsten Fahle et Meinolf Sellmann. « A Framework for Constraint Programming Based Column Generation, Principles and Practice of Constraint Programming, pp.261-274, 1999.

[. Khemmoudj, H. Bennaceur, and A. Nagih, Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs, AI) and Operations Research (OR) Techniques in Constraint Programming, pp.258-272, 2005.
DOI : 10.1007/11493853_20
URL : https://hal.archives-ouvertes.fr/hal-00421687

K. James and . «. Jr, The cutting-plane method for solving convex programs, Journal of the society for Industrial and Applied Mathematics, vol.84, pp.703-712, 1960.

[. Krakowski, E. Assoumou, V. Mazauric, and N. Maïzi, Feasible path toward 40???100% renewable energy shares for power supply in France by 2050: A prospective analysis, Applied Energy, vol.171, pp.501-522, 2016.
DOI : 10.1016/j.apenergy.2016.03.094
URL : https://hal.archives-ouvertes.fr/hal-01293627

[. Kadioglu and M. Sellmann, « Efficient Context-Free Grammar Constraints, pp.310-316, 2008.

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

A. «. Lodi, Mixed integer programming computation Years of Integer Programming, pp.50-619, 1958.
DOI : 10.1007/978-3-540-68279-0_16

G. Laporte and G. Pesant, A general multi-shift scheduling system, Journal of the Operational Research Society, vol.35, issue.11, pp.1208-1217, 2004.
DOI : 10.1007/BFb0017428

A. Lodi and A. Tramontani, Performance Variability in Mixed-Integer Programming, Theory Driven by Influential Applications. INFORMS, pp.1-12, 2013.
DOI : 10.1287/educ.2013.0112

[. Maïzi and E. Assoumou, Future prospects for nuclear power in France, Applied Energy, vol.136, pp.849-859, 2014.
DOI : 10.1016/j.apenergy.2014.03.056

]. M. Mah+08, N. Maher, C. Narodytska, T. Quimper, and . Walsh, « Flow-Based Propagators for the SEQUENCE and Related Global Constraints, Principles and Practice of Constraint Programming. T. 5202. Lecture Notes in Computer Science, pp.159-174, 2008.

[. Menana and S. Demassey, Sequencing and Counting with the multicost-regular Constraint, pp.178-192, 2009.
DOI : 10.1007/978-3-642-01929-6_14
URL : https://hal.archives-ouvertes.fr/hal-00394434

J. «. Menana, Automates et programmation par contraintes pour la planification de personnel, Thèse de doctorat. École des Mines de Nantes, pp.36-40, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00785838

[. Pesant, C. Quimper, L. Rousseau, and M. Sellmann, The Polytope of Context-Free Grammar Constraints, pp.223-232, 2009.
DOI : 10.1007/978-3-642-01929-6_17

G. «. Pesant, A Filtering Algorithm for the Stretch Constraint, pp.183-195, 2001.
DOI : 10.1007/3-540-45578-7_13

G. «. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, Principles and Practice of Constraint Programming, pp.482-495, 2004.
DOI : 10.1007/978-3-540-30201-8_36

E. Pinson, « Le problème de job-shop, Thèse de doctorat, p.53, 1988.

G. Perez and J. Régin, « Efficient Operations On MDDs For Building Constraint Programming Models, International Joint Conference on Artificial Intelligence, p.47, 2015.

[. Petit, J. Régin, and C. Bessiere, Specific Filtering Algorithms for Over-Constrained Problems, pp.451-463, 2001.
DOI : 10.1007/3-540-45578-7_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2556

J. Puchinger, J. Peter, . Stuckey, G. Mark, S. Wallace et al., Dantzig-Wolfe decomposition and branch-and-price solving in G12, Constraints, vol.139, issue.1, pp.77-99, 2011.
DOI : 10.1007/3-540-46584-7_20
URL : https://hal.archives-ouvertes.fr/hal-01224910

C. Quimper and L. Rousseau, A large neighbourhood search approach to??the?? multi-activity shift scheduling problem, Journal of Heuristics, vol.10, issue.2, pp.373-392, 2010.
DOI : 10.1057/jors.1993.198

C. Quimper and T. Walsh, Global Grammar Constraints, pp.751-755, 2006.
DOI : 10.1007/11889205_64
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.937

C. Quimper and T. Walsh, Decomposing Global Grammar Constraints, pp.590-604, 2007.
DOI : 10.1007/978-3-540-74970-7_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.1320

P. Refalo, Linear Formulation of Constraint Programming Models and Hybrid Solvers, pp.369-383, 2000.
DOI : 10.1007/3-540-45349-0_27

[. Régin, Combination of Among and Cardinality Constraints, pp.288-303, 2005.
DOI : 10.1007/11493853_22

[. Régin, « Global constraints : A survey ». In : Hybrid optimization, pp.63-134, 2011.

[. Régin, « A filtering algorithm for constraints of difference in CSPs, AAAI '94 : national conference on Artificial intelligence, pp.362-367, 1994.

[. Régin, « Generalized Arc Consistency for Global Cardinality Constraint, 13th conference on Artificial intelligence. AAAI'96, pp.209-215, 1996.

K. Ted, M. Ralphs, and . Güzelsoy, « The SYMPHONY callable library for mixed integer programming » In : The next wave in computing, optimization, and decision technologies, pp.61-76, 2005.

K. Ted, . Ralphs, V. Matthew, and . Galati, « Decomposition methods for integer programming, Wiley Encyclopedia of Operations Research and Management Science, 2010.

[. Ralphs and L. Ladányi, COIN/BCP user's manual, 2001.

[. Puget, « A filtering algorithm for global sequencing constraints, Principles and Practice of Constraint Programming, pp.32-46, 1997.

A. Schutt, T. Feydy, J. Peter, . Stuckey, G. Mark et al., Solving RCPSP/max by lazy clause generation, Journal of Scheduling, vol.16, issue.3, pp.273-289, 2013.
DOI : 10.1007/11562931_3

[. Sellmann, The Theory of Grammar Constraints, pp.530-544, 2006.
DOI : 10.1007/11889205_38

P. «. Shaw, . Constraint-for-bin, and . Packing, Principles and Practice of Constraint Programming. Sous la dir. de Mark Wallace. T. 3258. Lecture Notes in Computer Science, pp.648-662, 2004.

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7295

. Sof, C. Openstack, and . Software, OpenStack Cloud Software

[. Schulte and G. Tack, Weakly Monotonic Propagators, pp.723-730, 2009.
DOI : 10.1145/976706.976714

S. Erlendur and . Thorsteinsson, Branch-and-check : A hybrid framework integrating mixed integer programming and constraint logic programming ». In : Principles and Practice of Constraint Programming, pp.16-30, 2001.

J. Tony and . Van-roy, « Cross decomposition for mixed integer programming », In : Mathematical programming, vol.251, pp.46-63, 1983.

A. Laurence and . Wolsey, Integer programming. T. 42, p.38, 1998.

H. Tallys, . Yunes, V. Arnaldo, . Moura, C. Cid et al., « Hybrid column generation approaches for urban transit crew management problems, Transportation Science, vol.392, pp.273-288, 2005.