E. Althaus, A. Bockmayr, M. Elf, M. Jünger, T. Kasper et al., SCIL ??? Symbolic Constraints in Integer Linear Programming, Proceedings of the 10th Annual European Symposium on Algorithms (ESA), volume 2461 of Lecture Notes in Computer Science, pp.75-87, 2002.
DOI : 10.1007/3-540-45749-6_11
URL : https://hal.archives-ouvertes.fr/inria-00100922

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

F. Azevedo, Cardinal: A Finite Sets Constraint Solver, Constraints, vol.12, issue.1, pp.93-129, 2007.
DOI : 10.1007/s10601-006-9012-6

N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9
URL : https://hal.archives-ouvertes.fr/hal-00442810

N. Beldiceanu, P. Flener, and X. Lorca, The tree Constraint, Proceedings of the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp.64-78, 2005.
DOI : 10.1007/11493853_7
URL : https://hal.archives-ouvertes.fr/hal-00445174

C. Bessiere, Constraint Propagation, Handbook of Constraint Programming, chapter 3, 2006.
DOI : 10.1016/S1574-6526(06)80007-6
URL : https://hal.archives-ouvertes.fr/lirmm-00117128

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

G. Carpaneto, M. Dell-'amico, and P. Toth, Exact solution of large-scale, asymmetric traveling salesman problems, ACM Transactions on Mathematical Software, vol.21, issue.4, pp.394-409, 1995.
DOI : 10.1145/212066.212081

Y. Caseau and F. Laburthe, Solving small TSPs with constraints, Proceedings of the 14th International Conference on Logic Programming (ICLP), pp.316-330, 1997.

B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the ACM, vol.47, issue.6, pp.1028-1047, 2000.
DOI : 10.1145/355541.355562

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1990.

B. Dixon, M. Rauch, and R. Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time, SIAM Journal on Computing, vol.21, issue.6, pp.1184-1192, 1992.
DOI : 10.1137/0221070

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

G. Dooms and I. Katriel, The ???Not-Too-Heavy Spanning Tree??? Constraint, Proceedings of the Fourth International Conference on 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, Proceedings of the 17th International Conference on the Principles and Practice of Constraint Programming (CP), pp.271-285, 2011.
DOI : 10.1007/978-3-642-23786-7_22
URL : https://hal.archives-ouvertes.fr/hal-00644787

M. Fischetti and P. Toth, An Additive Bounding Procedure for Combinatorial Optimization Problems, Operations Research, vol.37, issue.2, pp.319-328, 1989.
DOI : 10.1287/opre.37.2.319

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, Solving Combinatorial Optimization Problems in Constraint Programming, 2001.

F. Focacci, A. Lodi, and M. Milano, Cost-Based Domain Filtering, Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming (CP), pp.189-203, 1999.
DOI : 10.1007/978-3-540-48085-3_14

F. Focacci, A. Lodi, M. Milano, and D. Vigo, Solving TSP through the Integration of OR and CP Techniques, Electronic Notes in Discrete Mathematics, vol.1, pp.13-25, 1999.
DOI : 10.1016/S1571-0653(04)00002-2

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

L. , G. Kaya, and J. N. Hooker, A filter for the circuit constraint, Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming, pp.706-710, 2006.

C. Gervet, New structures of symbolic constraint objects: sets and graphs, Third Workshop on Constraint Logic Programming (WCLP'2003), 1993.

C. Gervet, Constraints over Structured Domains, Handbook of Constraint Programming, chapter 17, 2006.
DOI : 10.1016/S1574-6526(06)80021-0

M. Grötschel and O. Holland, Solution of large-scale symmetric travelling salesman problems, Mathematical Programming, vol.1, issue.1-3, pp.141-202, 1991.
DOI : 10.1007/BF01586932

G. Gutin and A. P. Punnen, The Traveling Salesman Problem and Its Variations, 2007.
DOI : 10.1007/b101971

M. Held and R. M. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees, Operations Research, vol.18, issue.6, pp.1138-1162, 1970.
DOI : 10.1287/opre.18.6.1138

M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees: Part II, Mathematical Programming, vol.6, issue.1, 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

K. Helsgaun, General k-opt submoves for the Lin???Kernighan TSP heuristic, Mathematical Programming Computation, vol.59, issue.4, pp.119-163, 2009.
DOI : 10.1007/s12532-009-0004-6

W. Van-hoeve and I. Katriel, Global Constraints, Handbook of Constraint Programming, 2006.
DOI : 10.1016/S1574-6526(06)80010-6

R. Jonker and T. Volgenant, Transforming asymmetric into symmetric traveling salesman problems, Operations Research Letters, vol.2, issue.4, pp.161-163, 1983.
DOI : 10.1016/0167-6377(83)90048-2

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Animations, pp.85-103, 1972.

P. Kilby and P. Shaw, Vehicle Routing, Handbook of Constraint Programming, chapter 23, 2006.
DOI : 10.1016/S1574-6526(06)80027-1

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

J. Lauriere, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

A. Lodi, M. Milano, and L. Rousseau, Discrepancy-Based Additive Bounding Procedures, INFORMS Journal on Computing, vol.18, issue.4, pp.480-493, 2006.
DOI : 10.1287/ijoc.1050.0168

M. Milano and W. J. Van-hoeve, Reduced Cost-Based Ranking for Generating Promising Subproblems, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP), pp.1-16, 2002.
DOI : 10.1007/3-540-46135-3_1

G. Pesant, M. Gendreau, J. Y. Potvin, and J. M. 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

R. C. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

J. F. Puget, PECOS: a high level constraint programming language, Proceedings of the Singapore International Conference on Intelligent Systems (SPICIS), 1992.

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

J. Régin, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint, Proceedings of the Fifth International Conference on 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, Global Constraints: A Survey, Hybrid Optimization, pp.63-134, 2011.
DOI : 10.1007/978-1-4419-1644-0_3

J. Régin, L. Rousseau, M. Rueher, and W. Van-hoeve, The Weighted Spanning Tree Constraint Revisited, Proceedings of the Seventh International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp.176-180, 2010.
DOI : 10.1007/978-3-642-13520-0_31

M. Sellmann, Theoretical Foundations of CP-Based Lagrangian Relaxation, Proceedings of the 10th International Conference on the Principles and Practice of Constraint Programming (CP), pp.634-647, 2004.
DOI : 10.1007/978-3-540-30201-8_46

R. Tarjan, Sensitivity analysis of minimum spanning trees and shortest path trees, Information Processing Letters, vol.14, issue.1, pp.30-33, 1982.
DOI : 10.1016/0020-0190(82)90137-5

R. E. Tarjan, Applications of Path Compression on Balanced Trees, Journal of the ACM, vol.26, issue.4, pp.690-715, 1979.
DOI : 10.1145/322154.322161