Minimal ordering constraints for some families of variable symmetries

DOI10.1007/S10472-010-9174-1MaRDI QIDQ976995zbMATH OpenOpenAlexFDO

Authors Andrew Grayland, Chris Jefferson, Ian Miguel, Colva M. Roney-Dougal

Publication date 16 June 2010

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-010-9174-1

zbMATH Keywords

constraint modellingconstraint programmingsymmetry

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Principles and Practice of Constraint Programming – CP 2003
• Breaking Symmetry of Interchangeable Variables and Values
• The complexity of symmetry-breaking formulas
• Combining Symmetry Breaking and Global Constraints
• Breaking All Value Symmetries in Surjection Problems

Cites work

• scientific article; zbMATH DE number 813252 (Why is no real title available?)
• Symmetry Definitions for Constraint Satisfaction Problems

Cited in

(2)

• Disjoint direct product decompositions of permutation groups
• An adaptive prefix-assignment technique for symmetry reduction

This page was built for publication: Minimal ordering constraints for some families of variable symmetries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976995)