Symmetry Definitions for Constraint Satisfaction Problems
From MaRDI portal
Publication:3524161
DOI10.1007/11564751_5zbMath1153.68454MaRDI QIDQ3524161
Christopher Jefferson, Karen E. Petrie, Barbara M. Smith, Peter G. Jeavons, David A. Cohen
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:b0cd60ab-e27e-4f18-9948-fb496af60cfd
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
A Novel Approach For Detecting Symmetries in CSP Models, Automatic Generation of Symmetry-Breaking Constraints, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation, Dominance rules in combinatorial optimization problems, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Minimal ordering constraints for some families of variable symmetries, On implementing symmetry detection, Dynamic structural symmetry breaking for constraint satisfaction problems, Orbital shrinking: theory and applications, Symmetry in Mathematical Programming, Local Symmetry Breaking During Search in CSPs