A Novel Approach For Detecting Symmetries in CSP Models

DOI10.1007/978-3-540-68155-7_14zbMath1142.68520MaRDI QIDQ5387629

Maria Garcia de la Banda, Christopher Mears, Mark G. Wallace, Bart Demoen

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_14

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems, Pairwise symmetry reasoning for multi-agent path finding search, Lifting symmetry breaking constraints with inductive logic programming, Lightweight dynamic symmetry breaking, Symmetries, almost symmetries, and lazy clause generation, A method for detecting symmetries in constraint models and its generalisation, Symmetry in Mathematical Programming

Cites Work

• Unnamed Item
• On implementing symmetry detection
• Symmetry Definitions for Constraint Satisfaction Problems
• Automatic Detection of Variable and Value Symmetries
• General Symmetry Breaking Constraints
• Artificial Intelligence and Symbolic Computation
• Principles and Practice of Constraint Programming – CP 2003