A Probabilistic Model to Count Solutions on the alldifferent Constraint - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

A Probabilistic Model to Count Solutions on the alldifferent Constraint

(1, 2) , (1) , (3) , (4)
1
2
3
4

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.
Not file

Dates and versions

hal-01923767 , version 1 (15-11-2018)

Identifiers

  • HAL Id : hal-01923767 , version 1

Cite

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. ⟨hal-01923767⟩
151 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More