Pages that link to "Item:Q2643299"
From MaRDI portal
The following pages link to Generating effective symmetry-breaking predicates for search problems (Q2643299):
Displaying 11 items.
- A constraint-based approach to enigma 1225 (Q979859) (← links)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- CompoSAT: specification-guided coverage for model finding (Q2024373) (← links)
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
- Symmetry breaking for voting mechanisms (Q2233522) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- On local domain symmetry for model expansion (Q4593047) (← links)
- A Study of Symmetry Breaking Predicates and Model Counting (Q5039506) (← links)
- On the geometry of symmetry breaking inequalities (Q5925642) (← links)