R. Andrade, A. Lucena, and N. Maculan, Using Lagrangian dual information to generate degree constrained spanning trees, Discrete Applied Mathematics, vol.154, issue.5, pp.703-717, 2006.
DOI : 10.1016/j.dam.2005.06.011
URL : http://doi.org/10.1016/j.dam.2005.06.011

P. Benchimol, W. J. 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.1007/s10601-012-9119-x
URL : https://hal.archives-ouvertes.fr/hal-01099501

A. Salles, D. Cunha, and A. Lucena, Lower and upper bounds for the degree-constrained minimum spanning tree problem, Networks, vol.50, issue.1, pp.55-66, 2007.

A. Salles, D. Cunha, and A. Lucena, A hybrid relax-and-cut/branch and cut algorithm for the degree-constrained minimum spanning tree problem, 2008.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.1448

F. Focacci, A. Lodi, and M. Milano, Cost-Based Domain Filtering, CP, volume 1713 of Lecture Notes in Computer Science, pp.189-203, 1999.
DOI : 10.1007/978-3-540-48085-3_14

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, Optimization-oriented global constraints, Constraints, vol.7, issue.3/4, pp.351-365, 2002.
DOI : 10.1023/A:1020589922418

K. G. , F. , and P. J. Stuckey, Explaining circuit propagation, Constraints, vol.19, pp.1-29, 2013.

J. Maria, . García-de-la, P. J. Banda, J. Stuckey, and . Wazny, Finding all minimal unsatisfiable subsets, PPDP, pp.32-43, 2003.

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.

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

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

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

J. 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