, Depth First Branch and Bound with dynamic variable ordering and initial LDS with maximum discrepancy of 2, p.1513

D. Allouche, S. Traoré, I. André, S. De-givry, G. Katsirelos et al., Computational protein design as a cost function network optimization problem, CP 2012, vol.7514, pp.840-849, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01268632

E. Bensana, M. Lemaître, and G. Verfaillie, Earth observation satellite management, Constraints, vol.4, issue.3, pp.293-299, 1999.

S. Bistarelli, B. V. Faltings, and N. Neagu, Interchangeability in Soft CSPs, CP 2002, vol.2470, pp.31-46, 2002.

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

G. Chu, M. Banda, and P. Stuckey, Exploiting subproblem dominance in constraint programming, Constraints, vol.17, issue.1, pp.1-38, 2012.

G. Chu and P. J. Stuckey, A generic method for identifying and exploiting dominance relations, CP 2012, vol.7514, pp.6-22, 2012.

M. Cooper, S. Cussat-blanc, M. De-roquemaurel, and P. Régnier, Soft arc consistency applied to optimal planning, CP 2006, vol.4204, pp.680-684, 2006.

M. Cooper, S. De-givry, M. Sanchez, T. Schiex, M. Zytnicki et al., Soft arc consistency revisited, Artificial Intelligence, vol.174, pp.449-478, 2010.
URL : https://hal.archives-ouvertes.fr/hal-02662237

M. Cooper, S. De-givry, M. Sanchez, T. Schiex, and M. Zytnicki, Virtual arc consistency for weighted CSP, Proc. of AAAI, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02752851

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

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

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

B. Dahiyat and S. Mayo, Protein design automation, Protein Science, vol.5, issue.5, pp.895-903, 1996.

J. Desmet, M. Maeyer, B. Hazes, and I. Lasters, The dead-end elimination theorem and its use in protein side-chain positioning, Nature, vol.356, issue.6369, pp.539-542, 1992.

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

I. Georgiev, R. Lilien, and B. Donald, Improved pruning algorithms and divide-andconquer strategies for dead-end elimination, with application to protein design, Bioinformatics, vol.22, issue.14, pp.174-183, 2006.

R. Goldstein, Efficient rotamer elimination applied to protein side-chains and related spin glasses, Biophysical Journal, vol.66, issue.5, pp.1335-1340, 1994.

W. D. Harvey and M. L. Ginsberg, Limited discrepency search, Proc. of the 14th IJCAI, 1995.

A. Jouglet and J. Carlier, Dominance rules in combinatorial optimization problems, European Journal of Operational Research, vol.212, issue.3, pp.433-444, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00625751

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

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

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

J. Larrosa, F. Heras, and S. De-givry, A logical approach to efficient max-sat solving, Artif. Intell, vol.172, issue.2-3, pp.204-233, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02659328

J. Larrosa and T. Schiex, Solving weighted CSP by maintaining arc consistency, Artif. Intell, vol.159, issue.1-2, pp.1-26, 2004.

C. Lecoutre, L. Saïs, S. Tabary, and V. Vidal, Reasoning from last conflict(s) in constraint programming, Artificial Intelligence, vol.173, pp.1592-1614, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00868108

C. Lecoutre, O. Roussel, and D. E. Dehani, WCSP Integration of Soft Neighborhood Substitutability, CP 2012, vol.7514, pp.406-421, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00866333

K. Leyton-brown, M. Pearson, and Y. Shoham, Towards a Universal Test Suite for Combinatorial Auction Algorithms, pp.66-76, 2000.

L. Looger and H. Hellinga, Generalized dead-end elimination algorithms make largescale protein side-chain structure prediction tractable: implications for protein design and structural genomics, Journal of Molecular Biology, vol.307, issue.1, pp.429-445, 2001.

R. Niedermeier and P. Rossmanith, New upper bounds for maximum satisfiability, J. Algorithms, vol.36, issue.1, pp.63-88, 2000.

N. Pierce, J. Spriet, J. Desmet, and S. Mayo, Conformational splitting: A more powerful criterion for dead-end elimination, Journal of Computational Chemistry, vol.21, issue.11, pp.999-1009, 2000.

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