General Symmetry Breaking Constraints
From MaRDI portal
Publication:3524265
DOI10.1007/11889205_46zbMath1160.68571MaRDI 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Fundamental Domains for Symmetric Optimization: Construction and Search, Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches, A Novel Approach For Detecting Symmetries in CSP Models, Breaking symmetries with high dimensional graph invariants and their combination, Dominance rules in combinatorial optimization problems, \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver, Towards breaking more composition symmetries in partial symmetry breaking, A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem, Pairwise symmetry reasoning for multi-agent path finding search, Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs, Breaking symmetries in graph search with canonizing sets, Parameterized Complexity Results in Symmetry Breaking, Local Symmetry Breaking During Search in CSPs, Groupoids and Conditional Symmetry