HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Estimating the number of solutions on cardinality constraints

Abstract : The main asset of constraint programming is its wide variety of algorithms that comes from the major areas of artificial intelligence, logic programming and operational research. It offers specialists a limitless range of possible configurations to tackle combinatorial problems, but it becomes an obstacle to the wider diffusion of the paradigm. The current tools are very far from being used as a black-box tool, and it assumes a good knowledge of the field, in particular regarding the parametrization of solvers.In this thesis, we propose to analyze the behavior of cardinality constraints with probabilistic models and counting tools, to automatically parameterize constraint solvers: heuristics of choice of variables and choice of values and search strategies.
Document type :
Complete list of metadata

Cited literature [60 references]  Display  Hide  Download

Contributor : Abes Star :  Contact
Submitted on : Thursday, December 12, 2019 - 5:16:08 PM
Last modification on : Wednesday, April 27, 2022 - 3:46:27 AM
Long-term archiving on: : Friday, March 13, 2020 - 11:23:28 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02408009, version 1


Giovanni Christian Lo Bianco Accou. Estimating the number of solutions on cardinality constraints. Combinatorics [math.CO]. Ecole nationale supérieure Mines-Télécom Atlantique, 2019. English. ⟨NNT : 2019IMTA0155⟩. ⟨tel-02408009⟩



Record views


Files downloads