The following pages link to (Q4475622):
Displayed 19 items.
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Symmetry breaking constraints for value symmetries in constraint satisfaction (Q850460) (← links)
- Symmetry definitions for constraint satisfaction problems (Q850464) (← links)
- Predicting and detecting symmetries in FOL finite model search (Q861703) (← links)
- Static and dynamic structural symmetry breaking (Q976989) (← links)
- Dynamic structural symmetry breaking for constraint satisfaction problems (Q1037643) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Towards breaking more composition symmetries in partial symmetry breaking (Q1677433) (← links)
- Solving Kirkman's schoolgirl problem in a few seconds (Q1774517) (← links)
- Symmetry breaking revisited (Q1774518) (← links)
- Lightweight dynamic symmetry breaking (Q2342593) (← links)
- Dominance breaking constraints (Q2342647) (← links)
- A CSP search algorithm with responsibility sets and kernels (Q2454814) (← links)
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling (Q2830948) (← links)
- The Relation Between Complete and Incomplete Search (Q2950519) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance (Q3523073) (← links)
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) (← links)