Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains.
Manuel BodirskyMarcello MaminoCaterina ViolaPublished in: CoRR (2018)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- submodular functions
- constraint optimization
- graph coloring problems
- constraint propagation
- constraint programming
- search space
- np complete
- constraint solving
- np hard
- configuration problems
- combinatorial problems
- arc consistency
- non binary
- partial constraint satisfaction
- constraint networks
- soft constraints
- pseudo boolean optimization
- backtracking search
- forward checking
- constraint problems
- facility location problem
- combinatorial optimization
- energy function
- symmetry breaking
- linear programming
- graphical models
- finding optimal solutions
- optimization problems
- objective function
- set bounds propagation
- greedy algorithm