N. A. Lynch, Distributed Algorithms, 1996.

M. Yokoo, E. Durfee, T. Ishida, and K. Kuwabara, The distributed constraint satisfaction problem: Formalization and algorithms, IEEE Tr. Know. Data Engin, vol.10, pp.673-685, 1998.

A. Meisels and R. Zivan, Asynchronous forward-checking for discsps, Constraints, vol.12, pp.131-150, 2007.

P. J. Modi, W. M. Shen, M. Tambe, Y. , and M. , Adopt: asynchronous distributed constraint optimization with quality guarantees, Artificial Intelligence, vol.161, pp.149-180, 2005.

A. Chechetka and K. P. Sycara, No-commitment branch and bound search for distributed constraint optimization, Proc. AAMAS-06, pp.8-12, 2006.

. May, , pp.1427-1429

W. J. Van-hoeve and I. Katriel, Global constraints, Handbook of Constraint Programming, pp.205-244, 2006.

L. Michel, C. Schulte, and P. Van-hentenryck, Constraint programming tools, Trends in Constraint Programming, pp.41-57, 2007.

C. Bessiere and P. Van-hentenryck, To be or not to be ... a global constraint, Proc. CP-03, pp.789-794, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269643

M. Maher, Open contractible global constraints, Proc. IJCAI-09, pp.578-583, 2009.

I. Brito and P. Meseguer, Connecting ABT with arc consistency, Proc. CP-08, pp.387-401, 2008.

P. Gutierrez and P. Meseguer, BnB-ADOPT + with several soft AC levels, 2010.

, Proc. ECAI-10, pp.67-72

P. Gutierrez and P. Meseguer, Improving BnB-ADOPT + -AC, Proc, 2012.

. Aamas-12, , pp.111-222

R. Bejar, C. Domshlak, C. Fernandez, C. Gomes, B. Krishnamachari et al., Sensor networks and distributed csp: Communication, computation and complexity, Artificial Intelligence, vol.161, pp.117-147, 2005.

T. Petit, J. C. Regin, and C. Bessiere, Specific filtering algorithms for over-constrained problems, Proc. CP-01, pp.451-463, 2001.

C. Bessiere, I. Brito, A. Maestre, and P. Meseguer, Asynchronous backtracking without adding links: a new member in the ABT family, Artificial Intelligence, vol.161, pp.7-24, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00105347

A. B. Baker, The hazards of fancy backtracking, Proc. AAAI-94, pp.288-293, 1994.

M. Maher, Soggy constraints: Soft open global constraints, Proc. CP-09, pp.584-591, 2009.

P. Meseguer, F. Rossi, and T. Schiex, Soft constraints, Handbook of Constraint Programming, pp.279-326, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00748177

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for weighted CSP, Proc. IJCAI-03, pp.239-244, 2003.

J. H. Lee and K. L. Leung, Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction, Proc. IJCAI-09, pp.559-565, 2009.

W. Yeoh, A. Felner, and S. Koenig, BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm, JAIR, vol.38, pp.85-133, 2010.

P. Gutierrez and P. Meseguer, Saving redundant messages in BnB-ADOPT, Proc AAAI-10, pp.1259-1260, 2010.

I. Brito and P. Meseguer, Asynchronous backtracking for non-binary DisCSP. ECAI-06 DCR workshop, 2006.

R. Zivan and A. Meisels, Dynamic ordering for asynchronous backtracking on discsps, Constraints, vol.11, pp.179-197, 2006.

J. C. Regin, A filtering algorithm for constraints of difference in CSPs, Proc. AAAI-94, pp.362-367, 1994.

E. M. Palmer, Graphical Evolution, 1985.

A. Meisels, E. Kaplansky, I. Razgon, and R. Zivan, Comparing performance of distributed constraint processing algorithms. AAMAS-02 DCR workshop, pp.86-93, 2002.

W. J. Van-hoeve, G. Pesant, and L. M. Rousseau, On global warming: flow-based soft global constraints, Journal of Heuristics, vol.12, pp.347-373, 2006.