Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction.
Andrei A. KrokhinBenoît LarosePublished in: SIAM J. Discret. Math. (2008)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- constraint programming
- relaxation labeling
- russian doll search
- heuristic search
- phase transition
- soft constraints
- sat solvers
- constraint relaxation
- constraint solving
- combinatorial problems
- constraint networks
- constraint propagation
- search space
- temporal reasoning
- constrained problems
- np hard
- cost function