Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs
Konstantin MakarychevPublished in: CoRR (2012)
Keyphrases
- search space
- constraint satisfaction problems
- ordering heuristics
- search algorithm
- memetic algorithm
- constraint satisfaction
- constraint propagation
- simulated annealing
- randomly generated
- partial order
- random sat instances
- hypertree decomposition
- genetic algorithm
- tabu search
- branch and bound
- combinatorial optimization
- search procedure
- arc consistency
- global search
- hard constraints
- systematic search
- search strategy
- constraint programming
- sat problem
- symmetry breaking
- metaheuristic
- np complete
- multi objective
- binary csps