Explanation-Based Weighted Degree

Emmanuel Hébrard 1 Mohamed Siala 1
1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
Abstract : The weighted degree heuristic is among the state of the art generic variable ordering strategies in constraint programming. However, it was often observed that when using large arity constraints, its efficiency deteriorates significantly since it loses its ability to discriminate variables. A possible answer to this drawback is to weight a conflict set rather than the entire scope of a failed constraint. We implemented this method for three common global constraints (AllD-ifferent, Linear Inequality and Element) and evaluate it on instances from the MiniZinc Challenge. We observe that even with simple explanations, this method outperforms the standard Weighted Degree heuristic.
Document type :
Conference papers
CPAIOR, Jun 2017, Padoue, Italy. 9p., 2017
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

Contributor : Emmanuel Hebrard <>
Submitted on : Thursday, December 21, 2017 - 11:46:36 AM
Last modification on : Thursday, January 11, 2018 - 4:58:03 PM


Files produced by the author(s)


  • HAL Id : hal-01670307, version 1


Emmanuel Hébrard, Mohamed Siala. Explanation-Based Weighted Degree. CPAIOR, Jun 2017, Padoue, Italy. 9p., 2017. 〈hal-01670307〉



Record views


Files downloads