Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP).
Roberto BattitiMarco ProtasiPublished in: Discret. Appl. Math. (1999)
Keyphrases
- constraint satisfaction problems
- search space
- product configuration
- constraint satisfaction
- configuration problems
- hard constraints
- backtrack search
- constraint propagation
- constraint programming
- graph coloring problems
- search algorithm
- np complete
- constraint solving
- constraint networks
- arc consistency
- combinatorial optimization
- genetic algorithm
- heuristic search
- decomposition methods
- pseudo boolean optimization
- non binary
- memetic algorithm
- np hard
- metaheuristic
- constraint graph
- optimal solution
- ordering heuristics
- temporal constraints
- forward checking
- tabu search
- search strategies
- soft constraints
- search strategy
- simulated annealing
- description logics
- tractable subclasses
- finite domain
- distributed constraint satisfaction problems
- partial assignment
- difficult problems
- partial constraint satisfaction
- search tree