Conflict History Based Branching Heuristic for CSP Solving.
Djamal HabetCyril TerriouxPublished in: CIMA@ICTAI (2018)
Keyphrases
- variable ordering
- variable ordering heuristics
- constraint satisfaction problems
- combinatorial optimization
- forward checking
- constraint satisfaction
- dynamic constraint satisfaction problems
- backtracking algorithm
- search algorithm
- closest string
- constraint problems
- branch and bound search
- conflict resolution
- branch and bound
- constraint propagation
- constraint programming
- partial constraint satisfaction
- timetabling problem
- finding an optimal solution
- finding optimal solutions
- optimal solution
- sliding tile
- constraint networks
- arc consistency
- search strategies
- tabu search
- simulated annealing
- dynamic programming
- search space
- mixed integer program
- stochastic local search
- search heuristics
- exact algorithms
- distributed constraint satisfaction problems
- search tree
- np hard