Automatically exploiting symmetries in constraint programming
From MaRDI portal
Recommendations
Cited in
(22)- On implementing symmetry detection
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Symmetries, almost symmetries, and lazy clause generation
- A method for detecting symmetries in constraint models and its generalisation
- Formulation symmetries in circle packing
- Symmetry in mathematical programming
- Trends in constraint programming.
- Automatic Detection of Variable and Value Symmetries
- Automatically exploiting subproblem equivalence in constraint programming
- An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
- Breaking instance-independent symmetries in exact graph coloring
- CGRASS: A system for transforming constraint satisfaction problems
- Constraint generation via automated theory formation
- Automating Symmetry-Breaking Calculations
- Exploiting symmetry in SMT problems
- Symmetry breaking for pseudo-Boolean formulas
- AI*IA 2005: Advances in Artificial Intelligence
- Automatic Generation of Symmetry-Breaking Constraints
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
- Symmetry definitions for constraint satisfaction problems
This page was built for publication: Automatically exploiting symmetries in constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703914)