D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, 2006.

N. Beldiceanu, P. Flener, and X. Lorca, Combining Tree Partitioning, Precedence, and Incomparability Constraints, Constraints, vol.21, issue.1, pp.459-489, 2008.
DOI : 10.1007/s10601-007-9040-x
URL : https://hal.archives-ouvertes.fr/hal-00481533

N. Beldiceanu and X. Lorca, Necessary Condition for Path Partitioning Constraints In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, pp.141-154, 2007.

P. Benchimol, W. Van-hoeve, J. Régin, L. Rousseau, and M. Rueher, Improved filtering for weighted circuit constraints, Constraints, vol.26, issue.4
DOI : 10.1007/s10601-012-9119-x
URL : https://hal.archives-ouvertes.fr/hal-01099501

H. Cambazard and E. Bourreau, Conception d'une contrainte globale de chemin, Journées Nationales sur la résolution Pratique deProbì emes NP Complets , JNPC, pp.107-120, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00448531

G. Carpaneto, S. Martello, and P. Toth, Algorithms and codes for the assignment problem, Annals of Operations Research, vol.1, issue.1, pp.191-223, 1988.
DOI : 10.1007/BF02288323

Y. Caseau and F. Laburthe, Solving Small TSPs with Constraints, International Conference on Logic Programming, ICLP, pp.316-330, 1997.

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, pp.579-594, 2003.
DOI : 10.1016/S0191-2615(02)00045-0

G. Dooms, Y. Deville, and P. Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, Principles and Practice of Constraint Programming, pp.211-225, 2005.
DOI : 10.1007/11564751_18

G. Dooms and I. Katriel, The Minimum Spanning Tree Constraint, Principles and Practice of Constraint Programming, pp.152-166, 2006.
DOI : 10.1007/11889205_13

G. Dooms and I. Katriel, The ???Not-Too-Heavy Spanning Tree??? Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, pp.59-70, 2007.
DOI : 10.1007/978-3-540-72397-4_5

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

T. Feydy and P. J. Stuckey, Lazy Clause Generation Reengineered, Principles and Practice of Constraint Programming, pp.352-366, 2009.
DOI : 10.1147/rd.471.0057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.6909

M. Fischetti and P. Toth, An additive bounding procedure for the asymmetric travelling salesman problem, Mathematical Programming, vol.7, issue.1-3, pp.173-197, 1992.
DOI : 10.1007/BF01585701

F. Focacci, A. Lodi, and M. Milano, Embedding Relaxations in Global Constraints for Solving TSP and TSPTW, Annals of Mathematics and Artificial Intelligence, vol.34, issue.4, pp.291-311, 2002.
DOI : 10.1023/A:1014492408220

F. Focacci, A. Lodi, and M. Milano, A Hybrid Exact Algorithm for the TSPTW, INFORMS Journal on Computing, vol.14, issue.4, pp.403-417, 2002.
DOI : 10.1287/ijoc.14.4.403.2827

N. Harold, Z. Gabow, T. H. Galil, R. E. Spencer, and . Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica, vol.6, issue.2, pp.109-122, 1986.

B. Haeupler, T. Kavitha, R. Mathew, S. Sen, and R. E. Tarjan, Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. The Computing Research Repository, 1105.

M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees: Part II, Mathematical Programming, pp.6-25, 1971.
DOI : 10.1007/BF01584070

K. Helsgaun, An effective implementation of the Lin???Kernighan traveling salesman heuristic, European Journal of Operational Research, vol.126, issue.1, pp.106-130, 2000.
DOI : 10.1016/S0377-2217(99)00284-2

L. Genç, K. , and J. N. Hooker, A Filter for the Circuit Constraint, Principles and Practice of Constraint Programming, CP, pp.706-710, 2006.

V. King, A Simpler Minimum Spanning Tree Verification Algorithm, Workshop on Algorithms and Data Structures, WADS, pp.440-448, 1995.

W. Harold and . Kuhn, The Hungarian Method for the Assignment Problem, 50 Years of Integer Programming, pp.29-47, 1958.

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, pp.633-648, 2002.
DOI : 10.1007/3-540-46135-3_42

G. Pesant, M. Gendreau, J. Potvin, and J. Rousseau, An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows, Transportation Science, vol.32, issue.1, pp.12-29, 1998.
DOI : 10.1287/trsc.32.1.12

L. Quesada, P. Van-roy, Y. Deville, and R. Collet, Using Dominators for Solving Constrained Path Problems, Practical Aspects of Declarative Languages, PADL, pp.73-87, 2006.
DOI : 10.1007/11603023_6

J. Régin, A Filtering Algorithm for Constraints of Difference in CSPs, National Conference on Artificial Intelligence, AAAI, pp.362-367, 1994.

. Jean-charles and . Régin, Tutorial: Modeling Problems in Constraint Programming, Principles and Practice of Constraint Programming, 2004.

J. Régin, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, pp.233-247, 2008.
DOI : 10.1007/978-3-540-68155-7_19

J. Régin, L. Rousseau, M. Rueher, and W. Jan-van-hoeve, The Weighted Spanning Tree Constraint Revisited, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, pp.287-291, 2010.
DOI : 10.1007/978-3-642-13520-0_31

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

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

P. Vilím, O(n log n) Filtering Algorithms for Unary Resource Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, pp.335-347, 2004.