An Algorithm for Finding Robust and Stable Solutions for Constraint Satisfaction Problems with Discrete and Ordered Domains.
Laura ClimentRichard J. WallaceMiguel A. SalidoFederico BarberPublished in: ICTAI (2012)
Keyphrases
- constraint satisfaction problems
- optimal solution
- constraint satisfaction
- search space
- np hard
- computational complexity
- benchmark problems
- non binary
- path consistency
- constraint programming
- constraint propagation
- decomposition methods
- cost function
- randomly generated
- space complexity
- constraint optimization
- finding optimal solutions