The traveling salesman problem: a computational study, 2006. ,
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.40-44, 2010. ,
, Le défi des 1001 graphes. Interstices, 2017.
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
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
Fhcp challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem, 2019. ,
The traveling-salesman problem and minimum spanning trees, Operations Research, vol.18, issue.6, pp.1138-1162, 1970. ,
The traveling-salesman problem and minimum spanning trees: Part ii, Mathematical Programming, vol.1, issue.1, pp.6-25, 1971. ,
Tsplib-a traveling salesman problem library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991. ,
In: Principles and Practice of Constraint Programming -CP 2004, 10th International Conference, Proceedings, pp.634-647, 2004. ,
A note on finding the bridges of a graph, Inf. Process. Lett, vol.2, pp.160-161, 1974. ,
, Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, 1983.
Yet another optimal algorithm for 3-edge-connectivity, Journal of Discrete Algorithms, vol.7, issue.1, pp.130-146, 2009. ,
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights, Algorithmica, vol.56, issue.3, pp.297-312, 2010. ,