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

Saved in:
Bibliographic Details
Main Authors: SONG, Wen, CAO, Zhiguang, ZHANG, Jie, XU, Chi, LIM, Andrew
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/8070
https://ink.library.smu.edu.sg/context/sis_research/article/9073/viewcontent/LEARNING_VARIABLE.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Be the first to leave a comment!
You must be logged in first