Computing leximin-optimal solutions in constraint networks.
Sylvain BouveretMichel LemaîtrePublished in: Artif. Intell. (2009)
Keyphrases
- constraint networks
- optimal solution
- temporal reasoning
- tree decomposition
- constraint satisfaction
- constraint satisfaction problems
- set intersection
- temporal constraint networks
- path consistency
- tree width
- arc consistency
- backtracking algorithms
- high level
- metaheuristic
- scene labeling
- constraint programming
- complexity bounds
- qualitative spatial and temporal reasoning
- max csp
- series parallel
- branch and bound algorithm
- branch and bound
- np hard
- special case
- objective function