A manifold-based approach to sparse global constraint satisfaction problems.
Ali BaharevArnold NeumaierHermann SchichlPublished in: J. Glob. Optim. (2019)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- search space
- np complete
- high dimensional
- constraint programming
- constraint solving
- np hard
- non binary
- combinatorial problems
- arc consistency
- constraint solver
- constraint networks
- pseudo boolean optimization
- decomposition methods
- computational problems
- sat problem
- product configuration
- finite domain
- forward checking
- soft constraints
- global constraints
- temporal constraints
- constraint optimization
- backtracking search
- reasoning problems
- constraint graph
- tractable classes
- arithmetic constraints
- graph based representations
- phase transition