Logo image
Se connecter
Retour
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
Acte de colloque   Open Access

Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem

Christian Bessiere, Assef Chmeiss et Lakhdar Saïs
Principles and Practice of Constraint Programming — CP 2001 7th International Conference, CP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings, Vol.2239, pp.565-569
LNCS
7th International Conference on Principles and Practice of Constraint Programming (CP 2001) (Paphos, Cyprus, 26/11/2001–01/12/2001)
2001
DOI: https://doi.org/10.1007/3-540-45578-7_40

Résumé

One of the key factors in the efficiency of backtracking algorithms is the rule they use to decide on which variable to branch next (namely, the variable ordering heuristics). In this paper, we give a formulation of dynamic variable ordering heuristics that takes into account the properties of the neighborhood of the variable.

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image