N. Beldiceanu, M. Carlsson, and J. X. Rampon, Global Constraint Catalog, SICS, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00485396

S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie et al., Semiring-Based CSPs and Valued CSPs : Frameworks, Properties, and Compar-ison, Constraints, pp.4-7, 1999.
DOI : 10.1007/3-540-61479-6_19

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization, vol.4, 1999.
DOI : 10.1007/978-1-4757-3023-4_1

M. Cooper, S. De-givry, and T. Schiex, Optimal soft arc consistency, IJCAI, pp.68-73, 2007.

F. , F. Lodi-a, and . Milano-m, Optimization-Oriented Global Constraints, Constraints, vol.7, pp.3-4, 2002.

M. O. Khemmoudj, H. Bennaceur, and A. Nagih, Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs, CPAIOR, pp.258-272, 2005.
DOI : 10.1007/11493853_20

URL : https://hal.archives-ouvertes.fr/hal-00153285

M. O. Khemmoudj and H. Bennaceur, Clique Inference Process for Solving Max-CSP, CP, pp.746-750, 2006.
DOI : 10.1007/11889205_63

URL : https://hal.archives-ouvertes.fr/hal-00084903

M. O. Khemmoudj and H. Bennaceur, Valid Inequality Based Lower Bounds for WCSP, CP, pp.394-408, 2007.
DOI : 10.1007/978-3-540-74970-7_29

URL : https://hal.archives-ouvertes.fr/hal-00385821

A. Koster, Frequency Assignment : Models and Algorithms, 1999.

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for Weighted CSP, IJ- CAI, pp.239-244, 2003.

N. Maculan, M. De-mendona-passini, J. Andr-de-moura-brito, and I. Loiseau, Column-Generation in Integer Linear Programming, RAIRO - Operations Research, vol.37, issue.2, pp.67-83, 2003.
DOI : 10.1051/ro:2003014

L. Mohr and G. Masini, Good old discrete relaxation, ECAI, pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

P. Refalo, Linear Formulation of Constraint Programming Models and Hybrid Solvers, CP, pp.369-383, 2000.
DOI : 10.1007/3-540-45349-0_27

J. C. Régin, A Filtering Algorithm for Constraints of Diference in CSPs, AAAI, pp.362-367, 1994.

M. Sellmann, A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming, CPAIOR, pp.16-28, 2006.

M. Sellmann, Theoretical Foundations of CP-Based Lagrangian Relaxation, CP, pp.634-647, 2004.
DOI : 10.1007/978-3-540-30201-8_46