R. Ahuja, T. Magnanti, and J. Orlin, , 1993.

, Anonymous: Integration of structural constraints into TSP models, vol.1, p.12, 2019.

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2-3, p.235256, 2002.

J. E. Beasley, Lagrangian Relaxation, p.243303, 1993.

P. Benchimol, W. J. Van-hoeve, J. Régin, L. Rousseau, and M. Rueher, Improved ltering for weighted circuit constraints, Constraints, vol.17, issue.3, p.205233, 2012.

D. Bergman, A. A. Cire, and W. J. Van-hoeve, Improved constraint propagation via lagrangian decomposition, International Conference on Principles and Practice of Constraint Programming, vol.3038, 2015.

H. Cambazard and J. G. Fages, New ltering for atmostnvalue and its weighted variant: A lagrangian approach, Constraints, vol.20, issue.3, p.362380, 2015.

S. Demassey, Compositions and hybridizations for applied combinatorial optimization, Habilitation à Diriger des Recherches, 2017.
URL : https://hal.archives-ouvertes.fr/tel-01569853

S. Ducomman, H. Cambazard, and B. Penz, Alternative ltering for the weighted circuit constraint: Comparing lower bounds for the TSP and solving TSPTW, Proceedings of the Thirtieth AAAI Conference on Articial Intelligence, p.33903396, 2016.

J. Fages, X. Lorca, and L. Rousseau, The salesman and the tree: the importance of search in cp, Constraints, vol.21, issue.2, p.145162, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01097544

D. Fontaine, L. D. Michel, and P. V. Hentenryck, Constraint-based lagrangian relaxation, Principles and Practice of Constraint Programming -20th International Conference, vol.324, p.339, 2014.

A. Frangioni, Generalized bundle methods, SIAM J. on Optimization, vol.13, issue.1, p.156, 2002.

M. Gagliolo and J. Schmidhuber, Learning dynamic algorithm portfolios, Annals of Mathematics and Articial Intelligence, vol.47, issue.3-4, p.295328, 2006.

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

M. O. Khemmoudj, H. Bennaceur, and A. Nagih, Combining arc-consistency and dual lagrangean relaxation for ltering csps, International Conference on Integration of Articial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, p.258272, 2005.

A. Malapert, J. Régin, and M. Rezgui, Embarrassingly parallel search in constraint programming, J. Artif. Intell. Res. (JAIR), vol.57, p.421464, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01502813

J. Menana, Automates et programmation par contraintes pour la planication de personnel, 2011.

A. Palmieri, J. Régin, and P. Schaus, Parallel strategies selection, Principles and Practice of Constraint Programming -22nd International Conference, p.388404, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02133495

J. C. Régin, M. Rezgui, and A. Malapert, Embarrassingly parallel search, Principles and Practice of Constraint Programming, p.596610, 2013.

G. Reinelt, TSPLIBa traveling salesman problem library, ORSA Journal on Computing, vol.3, issue.4, p.376384, 1991.

M. Sellmann, Theoretical foundations of cp-based lagrangian relaxation. In: Principles and Practice of Constraint Programming -CP 2004, 10th International Conference, Proceedings, p.634647, 2004.

M. Sellmann and T. Fahle, Constraint programming based lagrangian relaxation for the automatic recording problem, Annals OR, vol.118, issue.1-4, p.1733, 2003.

Y. Shang and B. W. Wah, A discrete lagrangian-based global-search method for solving satisability problems, J. Global Optimization, vol.12, issue.1, p.6199, 1998.

B. W. Wah and Z. Wu, Discrete lagrangian methods for designing multiplierless twochannel PR-LP lter banks, VLSI Signal Processing, vol.21, issue.2, p.131149, 1999.

B. W. Wah and Z. Wu, The theory of discrete lagrange multipliers for nonlinear discrete optimization, Principles and Practice of Constraint Programming -CP'99, 5th International Conference, p.2842, 1999.