M. Bibliographie, N. Ågren, M. Beldiceanu, S. Carlsson, E. Demassey et al., A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects, p.98, 2009.

D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem : A Computational Study (Princeton Series in Applied Mathematics), p.55, 2007.

A. Asaf, H. Eran, Y. Richter, D. P. Connors, D. L. Gresh et al., Applying Constraint Programming to Identification and Assignment of Service Professionals, Principles and Practice of Constraint Programming ? CP 2010, pp.24-37, 2010.
DOI : 10.1007/978-3-642-15396-9_5

S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup, Dominators in Linear Time, SIAM Journal on Computing, vol.28, issue.6, pp.2117-2132, 1999.
DOI : 10.1137/S0097539797317263

R. Barták, Dynamic global constraints in backtracking based environments Available from : http://dx.doi.org/10.1023/A:1021805623454, doi:10.1023/ A:1021805623454. 102, 103 [BC01] Nicolas Beldiceanu and Mats Carlsson. Pruning for the minimum constraint family and for the number of distinct values constraint family Available from, Principles and Practice of Constraint Programming ? CP 2001, pp.101-119, 2001.

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007.
DOI : 10.1007/s10601-006-9010-8

N. Beldiceanu, M. Carlsson, J. Rampon, and C. Truchet, Graph Invariants as Necessary Conditions for Global Constraints, Lecture Notes in Computer Science, vol.3709, pp.92-106, 2005.
DOI : 10.1007/11564751_10

A. A. Bcs-+-14-]-david-bergman, A. Cire, H. Sabharwal, V. Samulowitz, W. Saraswat et al., Parallel Combinatorial Optimization with Decision Diagrams, Lecture Notes in Computer Science, vol.8451, pp.351-367, 2014.
DOI : 10.1007/978-3-319-07046-9_25

N. Bel00 and . Beldiceanu, Global constraints as graph properties on a structured network of elementary constraints of the same type Principles and Practice of Constraint Programming ? CP, Lecture Notes in Computer Science, vol.1894, pp.52-66, 2000.

N. Thierry-benoist, P. Beldiceanu, X. Flener, and . Lorca, The tree constraint Combining tree partitioning, precedence, and incomparability constraints Available from, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ? CPAIOR 2005, pp.12-64, 2005.

E. Bessiere, B. Hebrard, Z. Hnich, T. Kiziltan, and . Walsh, Filtering Algorithms for the NValue Constraint, Constraints, vol.48, issue.22, pp.271-293, 2006.
DOI : 10.1007/s10601-006-9001-9
URL : https://hal.archives-ouvertes.fr/lirmm-00106098

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints Available from : http: //dblp.uni-trier Algorithm 457 : Finding all cliques of an undirected graph Available from, European Conference on Artificial Intelligence ? ECAI 2004BK73] Coen Bron and Joep Kerbosch, pp.146-150, 1973.

C. Bessiere, G. Katsirelos, N. Narodytska, and T. Walsh, Circuit complexity and decompositions of global constraints, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp.412-418, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00382608

A. L. Buchsbaum, H. Kaplan, A. Rogers, J. R. , N. Beldiceanu et al., A new, simpler linear-time dominators algorithm, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ? CPAIOR 2007, pp.1265-1296, 1998.
DOI : 10.1145/295656.295663

J. L. Bentley and T. A. Ottmann, Algorithms for reporting and counting geometric intersections Available from, IEEE Trans. Comput, vol.28, issue.9, pp.643-647, 1979.

E. Bourreau, . Traitement, . De, L. Sur, . Graphes et al., Bounds of graph parameters for global constraints Available from, RAIRO -Operations Research, vol.29, issue.29, pp.31327-353, 1999.

J. , C. Beck, P. Prosser, and R. J. Wallace, Failing first : An update Available from, ECAI, pp.959-960, 2004.

J. , C. Beck, P. Prosser, and R. Wallace, Trying again to failfirst, Recent Advances in Constraints, pp.41-55

N. Beldiceanu and H. Simonis, A Constraint Seeker: Finding and Ranking Global Constraints from Examples, Principles and Practice of Constraint Programming ? CP 2003, pp.12-26, 1007.
DOI : 10.1007/978-3-642-23786-7_4
URL : https://hal.archives-ouvertes.fr/hal-00754010

W. Benchimol, J. Van-hoeve, L. Régin, M. Rousseau, and . Rueher, Improved filtering for weighted circuit constraints, Cam14] Hadrien Cambazard Actes des 10e Journées nationales sur la résolution pratique de problèmes NP-complets ? JNPC'04, pp.205-233, 2004.
DOI : 10.1007/s10601-012-9119-x
URL : https://hal.archives-ouvertes.fr/hal-01099501

G. Chabert, L. Jaulin, and X. Lorca, A Constraint on the Number of Distinct Vectors with Application to Localization, Lecture Notes in Computer Science, vol.36, issue.9, pp.196-210, 2009.
DOI : 10.1109/31.34669
URL : https://hal.archives-ouvertes.fr/hal-00428967

Y. Caseau and F. Laburthe, Solving Small TSPs with Constraints, Proceedings of the 14th International Conference on Logic Programming ? ICLP 1997, pp.316-330, 1997.

. Artif, Available from, Int. Res, vol.14, issue.1, pp.205-230, 2001.

M. Dorigo, G. D. Caro, and L. M. Gambardella, Ant Algorithms for Discrete Optimization, Artificial Life, vol.54, issue.1, pp.137-172, 1999.
DOI : 10.1007/BF01797237

[. Dooms, Y. Deville, and P. Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, Lecture Notes in Computer Science, vol.3709, issue.29, pp.211-225, 2005.
DOI : 10.1007/11564751_18

T. Dao, K. Duong, and C. Vrain, A Declarative Framework for Constrained Clustering, Machine Learning and Knowledge Discovery in Databases, pp.419-434
DOI : 10.1007/978-3-642-40994-3_27
URL : https://hal.archives-ouvertes.fr/hal-00840374

T. Dao, K. Duong, and C. Vrain, Une approche en programmation par contraintes pour la classification non supervisée, EGC, volume RNTI-E-24 of Revue des Nouvelles Technologies de l'Information, pp.55-66, 2013.

D. Dowling, M. Krishnamoorthy, H. Mackenzie, and D. Sier, Staff rostering at a large international airport, Annals of Operations Research, vol.72, issue.11, pp.125-1471018992120116, 1997.
DOI : 10.1023/A:1018992120116

C. Matthijs, L. G. Dijkstra, M. Kroon, J. A. Salomon, . Van-nunen et al., Planning the Size and Organization of KLM's Aircraft Maintenance Personnel [Doo06] Grégoire Dooms. The CP(Graph) Computation Domain in Constraint Programming Using instance-level constraints in agglomerative hierarchical clustering : theoretical and empirical results Available from, Interfaces Faculté des Sciences Appliquées Data Mining and Knowledge Discovery, vol.24, issue.182, pp.47-58, 1994.

A. El-mouelhi, P. Jégou, and C. Terrioux, Different Classes of Graphs to Represent Microstructures for CSPs, Lecture Notes in Computer Science, vol.8323, issue.12, pp.21-38978, 2014.
DOI : 10.1007/978-3-319-04534-4_3

J. Fages and X. Lorca, Revisiting the tree Constraint, Principles and Practice of Constraint Programming ? CP 2011, pp.271-285, 2011.
DOI : 10.1007/978-3-642-23786-7_22
URL : https://hal.archives-ouvertes.fr/hal-00644787

J. Fages and X. Lorca, Improving the asymmetric tsp by considering graph structure
URL : https://hal.archives-ouvertes.fr/hal-00707510

[. Fages and T. Lapègue, Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem, Lecture Notes in Computer Science, vol.8124, issue.13, pp.63-79978
DOI : 10.1007/978-3-642-40627-0_8
URL : https://hal.archives-ouvertes.fr/hal-00859169

J. Fages, T. Focacci, A. Lodi, M. Focacci, A. Lodi et al., Available from : http://www.sciencedirect.com/science Cost-based domain filtering Available from : http://dx.doi.org/10 Embedding relaxations in global constraints for solving tsp and tsptw Available from, Filtering atmostnvalue with difference constraints : Application to the shift minimisation personnel task scheduling problem Principles and Practice of Constraint Programming ? CP'99, pp.116-133, 1999.

J. Fages, X. Lorca, and T. Petit, Self-decomposable global constraints, Proceedings of the 2014 Conference on ECAI 2014 : 21st European Conference on Artificial Intelligence, p.120, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088964

J. Fages, X. Lorca, and L. Rousseau, The salesman and the tree: the importance of search in CP, Constraints, p.119, 2014.
DOI : 10.1007/s10601-014-9178-2
URL : https://hal.archives-ouvertes.fr/hal-01436214

[. Fischetti, S. Martello, and P. Toth, The Fixed Job Schedule Problem with Spread-Time Constraints, Operations Research, vol.35, issue.6, pp.849-858, 1987.
DOI : 10.1287/opre.35.6.849

P. Flener, J. Pearson, M. Sellmann, P. Hentenryck, and M. Ågren, Dynamic structural symmetry breaking for constraint satisfaction problems, Constraints, vol.14, issue.4, pp.506-538, 2009.
DOI : 10.1007/s10601-008-9059-7

K. G. , F. , and P. J. Stuckey, Explaining circuit propagation Available from : http://dx.doi.org/10, Constraints, vol.19, issue.53, pp.1-29, 2014.

S. Gay, F. Fages, T. Martinez, S. Soliman, and C. Solnon, On the subgraph epimorphism problem, Discrete Applied Mathematics, vol.162, pp.214-228, 2014.
DOI : 10.1016/j.dam.2013.08.008
URL : https://hal.archives-ouvertes.fr/hal-01098527

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, p.81, 1979.

[. Gottlob, N. Leone, and F. Scarcello, A comparison of structural CSP decomposition methods, Artificial Intelligence, vol.124, issue.2, pp.243-282, 2000.
DOI : 10.1016/S0004-3702(00)00078-3

M. Gondran, M. Minoux, and . Graphes, Collection de la Direction des études et recherches d Available from : http://opac.inria.fr/record=b1077464 Exact solution of graph coloring problems via constraint programming and column generation Available from, INFORMS Journal on Computing, vol.11, issue.241, pp.1781-100, 1995.

M. Habib, On the power of graph searching, 2013. Invited lecture at CPAIOR 2012, p.12

M. Robert, G. L. Haralick, and . Elliott, Increasing tree search efficiency for constraint satisfaction problems, Proceedings of the 6th International Joint Conference on Artificial Intelligence, pp.356-364, 1979.

R. M. Karp, Available from : http://ideas.repec.org/a/eee/ ejores/v126y2000i1p106-130.html The traveling-salesman problem and minimum spanning trees : Part II Available from, Keld Helsgaun. An effective implementation of the Lin-Kernighan traveling salesman heuristic, pp.106-130, 1971.

F. Hermenier, J. L. Lawall, and G. Muller, BtrPlace: A Flexible Consolidation Manager for Highly Available Applications, Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing , STOC '94, pp.273-286, 1145.
DOI : 10.1109/TDSC.2013.5
URL : https://hal.archives-ouvertes.fr/hal-00916311

G. F. Italiano, L. Laura, and F. Santaroni, Finding Strong Bridges and Strong Articulation Points in Linear Time, Combinatorial Optimization and Applications, pp.157-169978
DOI : 10.1007/978-3-642-17458-2_14

L. Jaulin, Pure range-only slam with indistinguishable marks, 2014. submitted to Artificial Intelligence, p.97

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.
DOI : 10.1016/S0004-3702(02)00400-9

P. Jégou and C. Terrioux, Bag-connected tree-width : A new parameter for graph decomposition, International Symposium on Artificial Intelligence and Mathematics ? ISAIM 2014, p.28, 2014.

G. Leo, M. Kroon, . Salomon, N. Luk, and . Van-wassenhove, Exact and approximation algorithms for the tactical fixed interval scheduling problem Available from, Operations Research Proceedings, pp.506-506, 1993.

[. Korte and J. Vygen, The traveling salesman problem

A. Letort, M. Carlsson, and N. Beldiceanu, A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint, Lecture Notes in Computer Science, vol.7874, issue.114, pp.144-159
DOI : 10.1007/978-3-642-38171-3_10
URL : https://hal.archives-ouvertes.fr/hal-00874286

[. Leone, P. Festa, and E. Marchitto, A Bus Driver Scheduling Problem: a??new mathematical model and a GRASP approximate solution, Journal of Heuristics, vol.1, issue.12, pp.441-466, 2011.
DOI : 10.1007/s10732-010-9141-3

[. Lapègue, J. Fages, D. Prot, and O. Bellenguez-morineau, Personnel Task Scheduling Problem Library Available from : https://sites.google.com/site, p.88, 2013.

X. Lorca, Tree-based Graph Partitioning Constraint Available from : http://iste.co.uk/index.php?f=x&ACTION= View&id=418, p.42, 2011.

C. Le-pape, L. Perron, J. Régin, and P. Shaw, Robust and Parallel Solving of a Network Design Problem, Principles and Practice of Constraint Programming ? CP 2002 CP workshop on Techniques foR Implementing Constraint programming Systems (TRICS), pp.633-648, 2002.
DOI : 10.1007/3-540-46135-3_42

C. Lecoutre, L. Sais, S. Tabary, and V. Vidal, Last conflict based reasoning The Netherlands, The Netherlands, Proceedings of the 2006 Conference on ECAI 2006 : 17th European Conference on Artificial Intelligence, pp.133-137, 2006.

C. Lecoutre, L. Saïs, S. Tabary, V. Lin, and K. Ying, Reasoning from last conflict(s) in constraint programming, Artificial Intelligence, vol.173, issue.18, pp.1592-1614323, 2009.
DOI : 10.1016/j.artint.2009.09.002
URL : https://hal.archives-ouvertes.fr/hal-00868108

J. Michael and . Maher, Open contractible global constraints, Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI'09, pp.578-583, 2009.

[. Mairy, Y. Deville, and C. Lecoutre, Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency, Lecture Notes in Computer Science, vol.8451, issue.26, pp.235-25010, 2014.
DOI : 10.1007/978-3-319-07046-9_17

T. Martinez, F. Fages, P. Morignot, and S. Soliman, Search as constraint satisfaction, p.98, 2014.

L. Michel and P. Hentenryck, Activity-Based Search for Black-Box Constraint Programming Solvers, Lecture Notes in Computer Science, vol.7298, issue.28, pp.228-243
DOI : 10.1007/978-3-642-29828-8_15

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, issue.0, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

[. Ndiaye and C. Solnon, CP Models for Maximum Common Subgraph Problems, Principles and Practice of Constraint Programming ? CP 2011, pp.637-644
DOI : 10.1007/978-3-642-23786-7_48
URL : https://hal.archives-ouvertes.fr/hal-01354447

[. Perron, Operations Research and Constraint Programming at Google, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming ? CP 2011, pp.2-2, 2011.
DOI : 10.1007/978-3-642-23786-7_2

T. Petit, J. Régin, C. Quesada, P. Van-roy, Y. Deville et al., Principles and Practice of Constraint Programming ? CP Available from Solving Constrained Graph Problems using Reachability Constraints based on Transitive Closure and Dominators Using dominators for solving constrained path problems Available from : http://dx Impact-based search strategies for constraint program- ming Available from, Proceedings of the 8th International Conference on Practical Aspects of Declarative Languages, PADL'06 Principles and Practice of Constraint Programming ? CP, pp.451-463, 2001.

J. Régin, A filtering algorithm for constraints of difference in csps American Association for Artificial Intelligence Available from, Proceedings of the Twelfth National Conference on Artificial Intelligence of AAAI '94, pp.362-367, 1994.

J. Régin, Generalized arc consistency for global cardinality constraint Available from, Proceedings of the Thirteenth National Conference on Artificial Intelligence of AAAI'96, pp.209-215, 1996.

J. Régin, Available from : http://dx.doi.org/ 10.1023/A:1020506526052, doi:10.1023/A:1020506526052. 28 [Rég03] Jean-Charles Régin. Using constraint programming to solve the maximum clique problem Available from, Principles and Practice of Constraint Programming ? CP 2003, pp.387-405, 2002.

J. Régin, Modeling problems in constraint programming, p.34, 2004.

J. Régin, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint, Lecture Notes in Computer Science, vol.5015, issue.59Rég11, pp.233-247, 2008.
DOI : 10.1007/978-3-540-68155-7_19

J. Régin, Global constraints : A survey Hybrid Optimization, volume 45 of Springer Optimization and Its Applications Available from, pp.63-134978, 2011.

J. Régin, Simple solutions for complex problems, 2013. ACP Research Excellence Award, CP 2013, p.62

D. Richter, B. Goldengorin, G. Jäger, and P. Molitor, Improving the Efficiency of Helsgaun???s Lin-Kernighan Heuristic for the Symmetric TSP, Proceedings of the 4th Conference on Combinatorial and Algorithmic Aspects of Networking , CAAN'07, pp.99-111, 2007.
DOI : 10.1007/978-3-540-77294-1_10

M. Jean-charles-régin, A. Rezgui, and . Malapert, Embarrassingly Parallel Search, Principles and Practice of Constraint Programming, pp.596-610
DOI : 10.1007/978-3-642-40627-0_45

J. Régin, L. Rousseau, M. Rueher, and W. Van-hoeve, The Weighted Spanning Tree Constraint Revisited, Lecture Notes in Computer Science, vol.6140, issue.62, pp.287-291
DOI : 10.1007/978-3-642-13520-0_31

M. Sellmann, Theoretical foundations of cp-based lagrangian relaxa- tion

M. Barbara, S. A. Smith, and . Grant, Trying harder to fail first Available from, ECAI, pp.249-253, 1998.

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principles and Practice of Constraint Programming ? CP 1998, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

C. Solnon, Alldifferent-based filtering for subgraph isomorphism Available from, Artificial Intelligence, vol.174, pp.12-13850, 2010.

C. Schulte and G. Tack, Views and iterators for generic constraint implementations, Proceedings of the 2005 Joint ERCIM/CoLogNET International Conference on Constraint Solving and Constraint Logic Programming ? CS- CLP 2005, pp.118-132, 2006.

C. Schulte and G. Tack, Weakly Monotonic Propagators, Principles and Practice of Constraint Programming ? CP 2009, pp.723-730, 2009.
DOI : 10.1145/976706.976714

T. Schrijvers, G. Tack, P. Wuille, H. Samulowitz, and P. Stuckey, Search combinators, Constraints, vol.12, issue.1???2, pp.269-305, 2013.
DOI : 10.1007/s10601-012-9137-8

P. Smet, T. Wauters, M. Mihaylov, and G. Vanden-berghe, The shift minimisation personnel task scheduling problem: A new hybrid approach and computational insights, Omega, vol.46, issue.0, pp.64-73, 2014.
DOI : 10.1016/j.omega.2014.02.003

[. Van-hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

P. Van-hentenryck, V. Saraswat, and Y. Deville, Design, implementation, and evaluation of the constraint language cc(FD), Lecture Notes in Computer Science, vol.910, pp.293-316, 1995.
DOI : 10.1007/3-540-59155-9_15

[. Wang, B. Qian, and I. Davidson, On constrained spectral clustering and its applications, Data Mining and Knowledge Discovery, vol.26, issue.2, pp.1-30, 2014.
DOI : 10.1007/s10618-012-0291-9