Learning variable ordering heuristics for solving constraint satisfaction problems

Backtracking search algorithms are often used to solve the Constraint Satisfaction Problem (CSP), which is widely applied in various domains such as automated planning and scheduling. The efficiency of backtracking search depends greatly on the variable ordering heuristics. Currently, the most commo...

Full description

Bibliographic Details
Main Authors: Song, Wen, Cao, Zhiguang, Zhang, Jie, Xu, Chi, Lim, Andrew
Other Authors: School of Computer Science and Engineering
Format: Journal Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/162726