Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs.
Konstantin MakarychevPublished in: STACS (2013)
Keyphrases
- search space
- constraint satisfaction problems
- search algorithm
- ordering heuristics
- constraint propagation
- genetic algorithm
- constraint satisfaction
- global search
- binary csps
- hypertree decomposition
- systematic search
- constraint networks
- arc consistency
- combinatorial optimization
- simulated annealing
- hill climbing
- job shop scheduling problem
- tree decomposition
- neural network
- memetic algorithm
- search procedure
- optimization problems
- backtrack search