Generating effective symmetry-breaking predicates for search problems
From MaRDI portal
Recommendations
Cites work
- Backjump-based backtracking for constraint satisfaction problems
- Doubly Lexical Orderings of Matrices
- Dynamic symmetry-breaking for Boolean satisfiability
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Isomorph-Free Exhaustive Generation
- Self-stabilizing systems in spite of distributed control
- The On-Line Encyclopedia of Integer Sequences
Cited in
(13)- A hybrid integer and constraint programming approach to solve nurse rostering problems
- CompoSAT: specification-guided coverage for model finding
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Symmetry breaking for voting mechanisms
- Constraints for symmetry breaking in graph representation
- Breaking symmetries in graph search with canonizing sets
- Improved static symmetry breaking for SAT
- On local domain symmetry for model expansion
- A study of symmetry breaking predicates and model counting
- On the geometry of symmetry breaking inequalities
- Breaking symmetries with high dimensional graph invariants and their combination
- Breaking symmetries from a set-covering perspective
- A constraint-based approach to enigma 1225
This page was built for publication: Generating effective symmetry-breaking predicates for search problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643299)
