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...
Saved in:
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 |
Similar Items
-
Learning variable ordering heuristics for solving constraint satisfaction problems
by: Song, Wen, et al.
Published: (2022) -
Solving functional constraints by variable substitution
by: Zhang, Y., et al.
Published: (2013) -
Learning to solve multiple-TSP with time window and rejections via deep reinforcement learning
by: ZHANG, Rongkai, et al.
Published: (2022) -
Learning to solve 3-D bin packing problem via deep reinforcement learning and constraint programming
by: JIANG, Yuan, et al.
Published: (2023) -
BINARY ENCODINGS FOR SOLVING AD-HOC CONSTRAINTS
by: WANG RUIWEI
Published: (2023)