M. S. Affane, H. Bennaceur, ;. E. Boros, and P. Hammer, Bennaceur and Osamni, 2003] H. Bennaceur and A. Osamni. Computing lower bounds for Max-CSP problems, Proc. 16 th International IEA/AIE conference, vol.123, pp.199-227, 1998.

C. Cooper-;-martin, ;. M. Cooper, and . Cooper, Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems, Artificial Intelligence, vol.134, issue.3, pp.69-92, 2003.

;. M. Cooper and . Cooper, High-order consistency in Valued Constraint Satisfaction, Constraints, vol.10, pp.283-305, 2005.

. Givry, The SoftCSP and Max-SAT benchmarks and algorithms web site, 2006.

. De-givry, Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP, Proc. of AAAI, vol.35, pp.287-306, 1988.

;. N. Karmarkar and . Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica, vol.4, pp.373-395, 1984.

;. A. Koster and . Koster-;-larrosa, Existential arc consistency: getting closer to full arc consistency in weighted CSPs, Proc. of the 19 th IJCAI, 1999.

;. J. Larrosa and . Larrosa, On arc and node consistency in weighted CSP, Proc. of AAAI, pp.48-53, 2002.

;. R. Masini, G. Mohr, . Masini, and . Schiex, Verfaillie. Valued constraint satisfaction problems: hard and easy problems, Proc. of the 14 th IJCAI, vol.1894, pp.411-424, 1988.

;. M. Schlesinger and . Schlesinger, Syntactic analysis of two-dimensional visual signals in noisy conditions, Kibernetika, vol.4, pp.113-130, 1976.

;. T. Werner and . Werner, A Linear Programming Approach to Max-sum Problem: A Review, 2005.