]. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie et al., Semiring-based CSPs and Valued CSPs : Frameworks, Properties, and Comparaison, Constraints, vol.4, issue.3, pp.199-240, 1970.
DOI : 10.1023/A:1026441215081
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.5664

F. Dobrian, M. Halappanavar, A. Kumar, and A. Pothen, Vertex-weighted matching algorithms for computing column-space bases, CSC05, 2005.

L. R. Ford and D. R. Fulkerson, Constructing Maximal Dynamic Flows from Static Flows, Operations Research, vol.6, issue.3, pp.419-433, 1958.
DOI : 10.1287/opre.6.3.419

E. Freuder, Partial Constraint Satisfaction, IJCAI, vol.89, issue.58, pp.1-3, 1989.
DOI : 10.1007/3-540-61479-6_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.7954

E. John, R. M. Hopcroft, and . Karp, A n 5/2 algorithm for maximum matchings in bipartite graphs, FOCS, pp.122-125, 1971.

U. Junker, Preferred Explanations and Relaxations for Over- Constrained Problems, 2004.

J. Larrosa and T. Schiex, Solving weighted CSP by maintaining arc consistency, Artificial Intelligence, vol.159, issue.1-2, pp.1-26, 2004.
DOI : 10.1016/j.artint.2004.05.004
URL : http://doi.org/10.1016/j.artint.2004.05.004

J. Métivier, P. Boizumault, and S. Loudni, ?-alldifferent : Softening alldifferent in weighted csps, pp.223-230, 2007.

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, Lecture Notes in Computer Science, vol.3258, pp.482-495, 2004.
DOI : 10.1007/978-3-540-30201-8_36

T. Petit, C. Bessiere, and J. C. Régin, A General Conflict- Set Based Framework for Partial Constraint Satisfaction, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269780

T. Petit, J. Régin, and C. Ere, Specific Filtering Algorithms for Over-Constrained Problems, Lecture Notes in Computer Science, vol.2239, pp.451-463, 2001.
DOI : 10.1007/3-540-45578-7_31

P. Prosser, K. Stergiou, and T. Walsh, Singleton Consistencies, Lecture Notes in Computer Science, vol.1894, pp.353-368, 2000.
DOI : 10.1007/3-540-45349-0_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4233

C. Quimper, A. López-ortiz, P. Van-beek, and A. Golynski, Improved Algorithms for the Global Cardinality Constraint, LNCS, vol.3258, pp.542-556, 2004.
DOI : 10.1007/978-3-540-30201-8_40

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

J. C. Régin, Generalized Arc Consistency for Global Cardinality Constraint, AAAI-96, pp.209-215, 1996.

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, pp.146-160, 1972.
DOI : 10.1109/swat.1971.10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

P. Van-hentenryck, Y. Deville, and C. M. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.2-391, 1992.
DOI : 10.1016/0004-3702(92)90020-X

W. J. Van-hoeve, A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint, LNCS, vol.3258, pp.679-689, 2004.
DOI : 10.1007/978-3-540-30201-8_49

W. J. Van-hoeve, G. Pesant, and L. M. Rousseau, On global warming: Flow-based soft global constraints, Journal of Heuristics, vol.1, issue.4, pp.347-373, 2006.
DOI : 10.1007/s10732-006-6550-4

A. Zanarini, M. Milano, and G. Pesant, Improved Algorithm for the Soft Global Cardinality Constraint, CPAIOR 2006, pp.288-299, 2006.
DOI : 10.1007/11757375_23