Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
From MaRDI portal
(Redirected from Publication:5038464)
Recommendations
- Optimal symmetry breaking for graph problems
- Certified dominance and symmetry breaking for combinatorial optimisation
- Dynamic structural symmetry breaking for constraint satisfaction problems
- When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
- Symmetry Breaking for Maximum Satisfiability
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Exploiting single-cycle symmetries in continuous constraint problems
- Exploiting symmetries within constraint satisfaction search
Cites work
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- A Novel Approach For Detecting Symmetries in CSP Models
- Answer set programming
- Automatic Detection of Variable and Value Symmetries
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Conflict-driven answer set solving: from theory to practice
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Inductive learning of answer set programs
- Learning programs by learning from failures
- Lifting symmetry breaking constraints with inductive logic programming
- On local domain symmetry for model expansion
- Optimization Methods for the Partner Units Problem
- Symmetric ILP: Coloring and small integers
- Symmetry and Satisfiability: An Update
- Symmetry definitions for constraint satisfaction problems
- Symmetry-breaking answer set solving
- Tractability frontiers of the partner units configuration problem
Cited in
(2)
This page was built for publication: Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038464)
