D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The traveling salesman problem: a computational study, 2006.

P. Benchimol, J. C. Régin, L. M. Rousseau, M. Rueher, and W. J. Van-hoeve, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.40-44, 2010.

N. Cohen and D. Coudert, Le défi des 1001 graphes. Interstices, 2017.

S. Ducomman, H. Cambazard, and B. Penz, Alternative filtering for the weighted circuit constraint: Comparing lower bounds for the tsp and solving tsptw, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01420964

J. G. Fages, X. Lorca, and L. M. Rousseau, The salesman and the tree: the importance of search in cp, Constraints, vol.21, issue.2, pp.145-162, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01436214

M. Haythorpe, Fhcp challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem, 2019.

M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees, Operations Research, vol.18, issue.6, pp.1138-1162, 1970.

M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees: Part ii, Mathematical Programming, vol.1, issue.1, pp.6-25, 1971.

G. Reinelt, Tsplib-a traveling salesman problem library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991.

M. Sellmann, In: Principles and Practice of Constraint Programming -CP 2004, 10th International Conference, Proceedings, pp.634-647, 2004.

R. E. Tarjan, A note on finding the bridges of a graph, Inf. Process. Lett, vol.2, pp.160-161, 1974.

R. E. Tarjan, Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, 1983.

Y. H. Tsin, Yet another optimal algorithm for 3-edge-connectivity, Journal of Discrete Algorithms, vol.7, issue.1, pp.130-146, 2009.

L. P. Yeh, B. F. Wang, and H. H. Su, Efficient algorithms for the problems of enumerating cuts by non-decreasing weights, Algorithmica, vol.56, issue.3, pp.297-312, 2010.