A note on arithmetic constraint propagation

Abstract : We consider the resolution by constraint programming of large problems, i.e. involving millions of constraints, which mainly imply arithmetic constraints, like shortest path problems or other related problems. We show that a simple constraint programming model is not competitive with dedicated algorithms (or dedicated constraints). This mainly comes from the propagation mechanism, i.e. the ordering along which the constraints are revised. Thus, we propose a modification of this propagation mechanism integrating the main ideas of the dedicated algorithms. We give some experiments for the shortest path problem and more general problems which confirms the robustness of our approach. Last, we give some results showing that only a few variables are considered more than once during a propagation step.
Type de document :
Rapport
2012
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00690317
Contributeur : Arnaud Malapert <>
Soumis le : jeudi 26 avril 2012 - 15:48:47
Dernière modification le : lundi 5 novembre 2018 - 15:48:02
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 00:08:04

Fichier

jfpc12-en.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00690317, version 1

Collections

Citation

Arnaud Malapert, Jean-Charles Régin. A note on arithmetic constraint propagation. 2012. 〈hal-00690317〉

Partager

Métriques

Consultations de la notice

142

Téléchargements de fichiers

75