ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Efficient algorithms for table constraints

Demeulenaere, Jordan
(2015)

Files

Demeulenaere_19811000_2014.pdf
  • Open access
  • Adobe PDF
  • 1008 KB
Download
Demeulenaere_19811000_2014_Annexe1.pdf
  • Open access
  • Adobe PDF
  • 236.01 KB
Download
Demeulenaere_19811000_2014_Annexe2.zip
  • Open access
  • Unknown
  • 48.09 KB
Download

Details

Supervisors
Schaus, Pierre
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] : ingénieur civil en informatique
Abstract
Constraint Programming (CP) is a powerful programming paradigm that can solve a multitude of combinatorial problems. One of the key concept of CP is propagation, which allows to reduce the search space associated to a problem without losing any of its solutions. A problem and the corresponding solutions are expressed thanks to variables and constraints between those same variables. There exist many different constraints, but ultimately the single table constraint allows to express any one of them. Therefore, finding a good propagation algorithm for this constraint is critical and subject to a lot of research. In this thesis, we were asked to study different table constraint propagators and implement the most efficient ones in OscaR. The best algorithms and implementations known as of writing are described and compared to each other in this document.