S. Bistarelli, B. Faltings, and N. Neagu, Interchangeability in soft CSPs, Proceedings of CSCLP'02, pp.31-46, 2002.

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

B. Y. Choueiry, B. Faltings, and R. Weigel, Abstraction by interchangeability in resource allocation, Proceedings of IJCAI'95, pp.1694-1710, 1995.

M. Cooper, Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems, pp.311-342, 2003.

M. Cooper, S. De-givry, M. Sanchez, T. Schiex, and M. Zytnicki, Virtual arc consistency for weighted CSP, Proceedings of AAAI'08, pp.253-258, 2008.

M. Cooper, S. De-givry, M. Sanchez, T. Schiex, M. Zytnicki et al., Soft arc consistency revisited, Artificial Intelligence, vol.174, issue.7-8, pp.449-478, 2010.
DOI : 10.1016/j.artint.2010.02.001
URL : http://doi.org/10.1016/j.artint.2010.02.001

M. C. Cooper, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Artificial Intelligence, vol.90, issue.1-2, pp.1-24, 1997.
DOI : 10.1016/S0004-3702(96)00018-5

S. De-givry, Singleton consistency and dominance for weighted CSP, Proceedings of CP'04 Workshop on Preferences and Soft Constraints, 2004.

S. De-givry, F. Heras, M. Zytnicki, and J. Larrosa, Existential arc consistency: Getting closer to full arc consistency in weighted CSPs, Proceedings of IJCAI'05, pp.84-89, 2005.

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, Proceedings of AAAI'91, pp.227-233, 1991.

A. Haselbock, Exploiting interchangeabilities in constraint satisfaction problems, Proceedings of IJCAI'93, pp.282-287, 1993.

S. Karakashian, R. Woodward, B. Choueiry, S. Prestwhich, and E. Freuder, A partial taxonomy of substitutability and interchangeability, 2010.

A. M. Koster, Frequency assignment: Models and Algorithms, 1999.

A. Lal, B. Y. Choueiry, and E. C. Freuder, Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs, Proceedings of AAAI'05, pp.397-404, 2005.

J. Larrosa, Node and arc consistency in weighted CSP, Proceedings of AAAI'02, pp.48-53, 2002.

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

S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, 1990.

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems: Hard and easy problems, Proceedings of IJCAI'95, pp.631-639, 1995.