Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains.
Manuel BodirskyMarcello MaminoCaterina ViolaPublished in: CSL (2018)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- submodular functions
- graph coloring problems
- constraint propagation
- constraint optimization
- constraint programming
- search space
- constraint networks
- configuration problems
- arc consistency
- np complete
- non binary
- combinatorial problems
- np hard
- facility location problem
- constraint problems
- backtracking search
- solving constraint satisfaction problems
- partial constraint satisfaction
- constraint solving
- search algorithm
- energy function
- simulated annealing
- pseudo boolean optimization