Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem.
Richard J. WallacePublished in: AAAI/IAAI, Vol. 1 (1996)
Keyphrases
- branch and bound
- constraint satisfaction problems
- search algorithm
- np hard
- constraint satisfaction
- lower bound
- upper bound
- qualitative and quantitative
- constraint propagation
- search space
- branch and bound algorithm
- heuristic search
- optimal solution
- combinatorial optimization
- computational complexity
- temporal constraints
- non binary
- decomposition methods