Pages that link to "Item:Q850464"
From MaRDI portal
The following pages link to Symmetry definitions for constraint satisfaction problems (Q850464):
Displayed 17 items.
- Power of pre-processing: production scheduling with variable energy pricing and power-saving states (Q823779) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
- A constraint-based approach to enigma 1225 (Q979859) (← links)
- The monoids of orders eight, nine \& ten. (Q1044226) (← links)
- Pairwise symmetry reasoning for multi-agent path finding search (Q2060696) (← links)
- Lifting symmetry breaking constraints with inductive logic programming (Q2163186) (← links)
- Constraint models for graceful graphs (Q2267806) (← links)
- Speeding up operations on feature terms using constraint programming and variable symmetry (Q2341834) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Lightweight dynamic symmetry breaking (Q2342593) (← links)
- Symmetries, almost symmetries, and lazy clause generation (Q2342601) (← links)
- A method for detecting symmetries in constraint models and its generalisation (Q2342650) (← links)
- Generating custom propagators for arbitrary constraints (Q2453695) (← links)
- Symmetry Breaking Constraints for the Minimum Deficiency Problem (Q2971392) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems (Q5038464) (← links)