Computing improved optimal solutions to max-min flexible constraint satisfaction problems.
Didier DuboisPhilippe FortempsPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- constraint satisfaction problems
- max min
- search space
- constraint satisfaction
- optimal solution
- np hard
- min max
- hill climbing
- constraint propagation
- constraint programming
- np complete
- non binary
- combinatorial problems
- arc consistency
- constraint solving
- soft constraints
- solving constraint satisfaction problems
- constraint problems
- branch and bound
- backtracking search
- robust optimization
- forward checking
- pseudo boolean optimization
- finding optimal solutions
- constraint networks
- decomposition methods
- search strategies
- dynamic programming
- lower bound
- search algorithm