Symmetry breaking in numeric constraint problems
10.1007/978-3-642-23786-7_25
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/15235
Tipus de documentText en actes de congrés
Data publicació2011
EditorSpringer
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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.
CitacióGoldsztejn, A. [et al.]. Symmetry breaking in numeric constraint problems. A: International Conference on Principles and Practice of Constraint Programming. "Principles and practice of constraint programming (CP 2011): 17th International conference, CP 2011: Perugia, Italy, September 12-16, 2011: proceedings". Perugia: Springer, 2011, p. 317-324.
Versió de l'editorhttp://dx.doi.org/10.1007/978-3-642-23786-7_25
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1262-Symmetry-B ... ic-Constraint-Problems.pdf | 248,2Kb | Visualitza/Obre |