On the power of structural decompositions of graph-based representations of constraint problems.
Gianluigi GrecoFrancesco ScarcelloPublished in: Artif. Intell. (2010)
Keyphrases
- optimization problems
- constraint problems
- graph based representations
- constraint satisfaction problems
- constraint satisfaction
- graph theory
- randomly generated
- constraint programming
- constraint propagation
- graph matching
- cost function
- search space
- soft constraints
- optimisation problems
- np complete
- np hard
- arc consistency
- computational intelligence
- neural network
- special case