General Symmetry Breaking Constraints
From MaRDI portal
Publication:3524265
DOI10.1007/11889205_46zbMath1160.68571OpenAlexW1858333687MaRDI QIDQ3524265
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11889205_46
Related Items (14)
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Breaking symmetries in graph search with canonizing sets ⋮ Towards breaking more composition symmetries in partial symmetry breaking ⋮ Breaking symmetries with high dimensional graph invariants and their combination ⋮ Dominance rules in combinatorial optimization problems ⋮ Local Symmetry Breaking During Search in CSPs ⋮ Groupoids and Conditional Symmetry ⋮ A Novel Approach For Detecting Symmetries in CSP Models ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem ⋮ Parameterized Complexity Results in Symmetry Breaking ⋮ Pairwise symmetry reasoning for multi-agent path finding search ⋮ \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver ⋮ Fundamental Domains for Symmetric Optimization: Construction and Search
This page was built for publication: General Symmetry Breaking Constraints