Variable symmetry breaking in numerical constraint problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- Algorithm 852
- Exploiting single-cycle symmetries in continuous constraint problems
- Exploiting symmetries within constraint satisfaction search
- Formulation symmetries in circle packing
- Fundamental Domains for Integer Programs with Symmetries
- Interval analysis for certified numerical solution of problems in robotics
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Parameterized complexity results in symmetry breaking
- Practical graph isomorphism. II.
- Propagation algorithms for lexicographic ordering constraints
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Signed fundamental domains for totally real number fields
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Symmetry breaking revisited
- Symmetry definitions for constraint satisfaction problems
- Symmetry in integer linear programming
- The Transitive Reduction of a Directed Graph
Cited in
(4)- Counting symmetry-breaking solutions to symmetric variational problems
- Exploiting single-cycle symmetries in continuous constraint problems
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation
- Actions of the hyperoctahedral group to compute minimal contractors
This page was built for publication: Variable symmetry breaking in numerical constraint problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900305)