Performances of pure random walk algorithms on constraint satisfaction problems with growing domains.
Wei XuFuzhou GongPublished in: J. Comb. Optim. (2016)
Keyphrases
- random walk
- constraint satisfaction problems
- constraint optimization
- constraint satisfaction
- pseudo boolean optimization
- combinatorial problems
- non binary
- constraint programming
- constraint propagation
- learning algorithm
- decomposition methods
- graph coloring problems
- directed graph
- backtracking search
- forward checking
- constraint solver
- search space
- multi db
- np hard
- constraint graph
- markov chain
- soft constraints
- combinatorial optimization
- binary constraints
- tractable classes
- dynamic programming
- transition probability matrix
- worst case