Abstract
Complete row and column symmetry breaking in constraint models using the lex leader method is generally prohibitively costly. Double lex, which is derived from lex leader, is commonly used in practice as an incomplete symmetry-breaking method for row and column symmetries. Double lex is based on a row-wise canonical variable ordering. However, this choice is arbitrary. We investigate other canonical orderings and focus on one in particular: snake ordering. From this we derive a corresponding incomplete set of symmetry breaking constraints, snake lex. Experimental data comparing double lex and snake lex shows that snake lex is substantially better than double lex in many cases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carlsson, M., Beldiceanu, N.: Arc-consistency for a chain of lexicographic ordering constraints. Technical Report T2002-18, SICS (2002)
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Inc., Florida (1996)
Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. KR, pp. 148–159 (1996)
Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)
Frisch, A.M., Harvey, W.: Constraints for breaking all row and column symmetries in a three-by-two-matrix. In: Proc. Symcon (2003)
Grayland, A., Jefferson, C., Miguel, I., Roney-Dougal, C.: Minimal ordering constraints for some families of variable symmetries. Annals Math. A. I. (to appear, 2009)
Hammons, A.R., Vijay Kumar, P., Calderbank, A.R., Sloane, N.J.A., Sol, P.: The z 4 -linearity of kerdock, preparata, goethals, and related codes. IEEE Trans. Inform. Theory 40(2), 301–319 (1994)
Huczynska, S.: Equidistant frequency permutation arrays and related constant composition codes. Circa Preprint 2009/2 (2009)
Meseguer, P., Torras, C.: Solving strategies for highly symmetric csps. In: IJCAI, pp. 400–405 (1999)
Öhrman, H.: Breaking symmetries in matrix models. MSc Thesis, Dept. Information Technology, Uppsala University (2005)
Smith, B.M.: Sets of Symmetry Breaking Constraints. In: Proceedings of SymCon 2005, the 5th International Workshop on Symmetry in Constraints (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grayland, A., Miguel, I., Roney-Dougal, C.M. (2009). Snake Lex: An Alternative to Double Lex. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)