Abstract
Several methods exist for breaking symmetry in constraint problems, but most potentially suffer from high memory requirements, high computational overhead, or both. We describe a new partial symmetry breaking method that can be applied
to arbitrary variable/value symmetries. It models dominance detection as a nonstationary optimisation problem, and solves it by resource-bounded
metaheuristic search in the symmetry group. It has low memory requirement and computational overhead, yet in preliminary experiments on BIBD design it breaks most symmetries.
to arbitrary variable/value symmetries. It models dominance detection as a nonstationary optimisation problem, and solves it by resource-bounded
metaheuristic search in the symmetry group. It has low memory requirement and computational overhead, yet in preliminary experiments on BIBD design it breaks most symmetries.
Original language | English |
---|---|
Title of host publication | Proceedings of the 8th International Workshop on Symmetry and Constraint Satisfaction Problems (SYMCON 2008) |
Publication status | Published - 2008 |
Event | 8th International Workshop on Symmetry and Constraint Satisfaction Problems (SYMCON 2008) - Sydney, Australia Duration: 14 Sept 2008 → … |
Conference
Conference | 8th International Workshop on Symmetry and Constraint Satisfaction Problems (SYMCON 2008) |
---|---|
Country/Territory | Australia |
City | Sydney |
Period | 14/09/08 → … |