Symmetry Breaking in Numeric Constraint Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Symmetry Breaking in Numeric Constraint Problems

Résumé

Symmetry-breaking constraints in the form of inequalities between variables have been proposed for a few kind of solution symmetries in numeric CSPs. We show that, for the variable symmetries among those, the proposed inequalities are but a specific case of a relaxation of the well-known LEX constraints extensively used for discrete CSPs. We discuss the merits of this relaxation and present experimental evidences of its practical interest.
Fichier non déposé

Dates et versions

hal-00835280 , version 1 (18-06-2013)

Identifiants

  • HAL Id : hal-00835280 , version 1

Citer

Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras. Symmetry Breaking in Numeric Constraint Problems. 17th international conference on Principles and practice of constraint programming, 2011, Perugia, Italy. pp.317-324. ⟨hal-00835280⟩
102 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More