A Probabilistic Model to Count Solutions on the alldifferent Constraint

Abstract : This article presents two probabilistic models for the alldifferent constraint. We are interested in studying the combinatorial structure of the alldifferent constraint. More specifically, we are interested in the existence of solutions for an instance of alldifferent and to count them. Such informations can be used in search heuristics. From this probabilistic approach, we show how to compute some estimators of the number of solutions and we use them in a search heuristics inspired by Counting-Based Search heuristics.
Type de document :
Communication dans un congrès
CP 2018 - The 24th International Conference on Principles and Practice of Constraints Programming, Aug 2018, Lille, France. 9 p., 2018, Doctoral Program Proceedings. 〈http://cp2018.a4cp.org/dp-proceedings.pdf#page=43〉
Liste complète des métadonnées

https://hal-mines-albi.archives-ouvertes.fr/hal-01923767
Contributeur : Imt Mines Albi Ecole Nationale Supérieure Des Mines d'Albi-Carmaux <>
Soumis le : jeudi 15 novembre 2018 - 14:17:46
Dernière modification le : jeudi 6 décembre 2018 - 01:23:41

Identifiants

  • HAL Id : hal-01923767, version 1

Collections

Citation

Giovanni Lo Bianco, Charlotte Truchet, Xavier Lorca, Vlady Ravelomanana. A Probabilistic Model to Count Solutions on the alldifferent Constraint. CP 2018 - The 24th International Conference on Principles and Practice of Constraints Programming, Aug 2018, Lille, France. 9 p., 2018, Doctoral Program Proceedings. 〈http://cp2018.a4cp.org/dp-proceedings.pdf#page=43〉. 〈hal-01923767〉

Partager

Métriques

Consultations de la notice

27