A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms.
Uros CibejLuka FürstJurij MihelicPublished in: Symmetry (2019)
Keyphrases
- symmetry breaking
- pruning the search space
- backtracking algorithms
- constraint satisfaction problems
- search space
- constraint programming
- constraint propagation
- search algorithm
- search tree
- constraint satisfaction
- constraint networks
- global constraints
- backtracking search
- non binary
- path consistency
- graph coloring
- combinatorial problems
- integer linear programming
- sat solvers
- symmetry breaking constraints
- arc consistency
- tree structure
- metaheuristic
- np complete
- branch and bound
- high utility
- search strategies
- state space
- np hard
- data structure
- optimal solution
- search strategy
- itemsets