scientific article; zbMATH DE number 2084698
From MaRDI portal
Publication:4475622
Recommendations
Cited in
(19)- Dynamic structural symmetry breaking for constraint satisfaction problems
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Reasoning from last conflict(s) in constraint programming
- Towards breaking more composition symmetries in partial symmetry breaking
- Solving Kirkman's schoolgirl problem in a few seconds
- Symmetry breaking revisited
- Lightweight dynamic symmetry breaking
- Dominance breaking constraints
- A CSP search algorithm with responsibility sets and kernels
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
- The Relation Between Complete and Incomplete Search
- Local Symmetry Breaking During Search in CSPs
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
- A branch-and-bound algorithm for hard multiple knapsack problems
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Symmetry definitions for constraint satisfaction problems
- Predicting and detecting symmetries in FOL finite model search
- Static and dynamic structural symmetry breaking
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475622)