Reinforcement learning for search tree size minimization in Constraint Programming: New results on scheduling benchmarks

Failure-Directed Search (FDS) is a significant complete generic search algorithm used in Constraint Programming (CP) to efficiently explore the search space, proven particularly effective on scheduling problems. This paper analyzes FDS’s properties, showing that minimizing the size of its search tre...

Ausführliche Beschreibung