Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2000

The Path-repair algorithm

Résumé

In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems: the path-repair algorithm. The two main points of that algorithm are: it makes use of a repair algorithm (local search) as a basis and it works on a partial instantiation in order to be able to use filtering techniques. Different versions are presented and first experiments with both systematic and non systematic versions show promising results.

Fichier principal
Vignette du fichier
WCP99.pdf (213.43 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00312820 , version 1 (26-08-2008)

Licence

Identifiants

Citer

Narendra Jussien, Olivier Lhomme. The Path-repair algorithm. Electronic Notes in Discrete Mathematics, 2000, 4, pp.2-16. ⟨10.1016/S1571-0653(05)80102-7⟩. ⟨hal-00312820⟩
312 Consultations
675 Téléchargements

Altmetric

Partager

  • More