E. Boros and P. Hammer, Pseudo-Boolean Optimization, Discrete Appl. Math, vol.123, pp.155-225, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01150533

B. Cabon, S. De-givry, L. Lobjois, T. Schiex, and J. Warners, Radio link frequency assignment, Constraints, vol.4, pp.79-89, 1999.
URL : https://hal.archives-ouvertes.fr/hal-02695373

D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, A Maximal Tractable Class of Soft Constraints, Journal of Artificial Intelligence Research, vol.22, pp.1-22, 2004.

D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, The complexity of soft constraint satisfaction, Artificial Intelligence, vol.170, issue.11, pp.983-1016, 2006.

M. Cooper and T. Schiex, Arc consistency for soft constraints, Artificial Intelligence, vol.154, pp.199-227, 2004.

M. Cooper, S. De-givry, and T. Schiex, Optimal soft arc consistency, Proc. of IJCAI-07, pp.68-73, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02754114

M. Cooper, Minimization of locally-defined submodular functions by Optimal Soft Arc Consistency, Constraints, vol.13, issue.4, 2008.

S. De-givry, M. Zytnicki, F. Heras, and J. Larrosa, Existential arc consistency: Getting closer to full arc consistency in weighted csps, Proc. of IJCAI-05, pp.84-89, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02762983

F. Heras, J. Larrosa, and A. Oliveras, MiniMaxSat: A New Weighted Max-SAT Solver, Proc. of SAT'2007, number 4501 in LNCS, pp.41-55, 2007.

P. Jeavons, C. , and M. , Tractable constraints on ordered domains, Artificial Intelligence, vol.79, issue.2, pp.327-339, 1995.

L. Khatib, P. Morris, R. Morris, and F. Rossi, Temporal constraint reasoning with preferences, Proc. of the 17 th IJCAI, pp.322-327, 2001.

J. Kratica, D. Tosic, V. Filipovic, and I. Ljubic, Solving the Simple Plant Location Problems by Genetic Algorithm, RAIRO Operations Research, vol.35, pp.127-142, 2001.

C. Li, F. Manyà, and J. Planes, Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers, Proc of CP-05, number 3709 in LNCS, pp.403-414, 2005.

J. Régin, T. Petit, C. Bessière, and J. Puget, New Lower Bounds of Constraint Violations for Over-Constrained Problems, Proc. of CP-01, number 2239 in LNCS, pp.332-345, 2001.

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, Proc. of IJCAI-95, pp.631-637, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02778456

T. Schiex, Arc consistency for soft constraints, Proc. of CP-00, vol.1894, pp.411-424, 2000.

M. Schlesinger, Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of twodimensional visual signals in noisy conditions), Kibernetika, vol.4, pp.113-130, 1976.

D. Schlesinger, Exact Solution of Permuted Submodular MinSum Problems, Energy Minimization Methods in Computer Vision and Pattern Recognition, number 4679/2007 in LNCS, pp.28-38, 2007.

T. Werner, A Linear Programming Approach to Max-sum Problem: A Review, IEEE Trans. on Pattern Recognition and Machine Intelligence, vol.29, issue.7, pp.1165-1179, 2007.

M. Zytnicki, C. Gaspin, and T. Schiex, A new local consistency for weighted CSP dedicated to long domains, Proceedings of the 2006 ACM Symposium on Applied Computing, pp.394-398, 2006.