Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver [0.03%]
在约束编程求解器中学习和微调通用的价值选择启发式算法
Tom Marty,Léo Boisvert,Tristan François et al.
Tom Marty et al.
Constraint programming is known for being an efficient approach to solving combinatorial problems. Important design choices in a solver are the branching heuristics, designed to lead the search to the best solutions in a minimum amount of t...
Maxime Mulamba,Jayanta Mandi,Ali İrfan Mahmutoğulları et al.
Maxime Mulamba et al.
We consider the problem of perception-based constraint solving, where part of the problem specification is provided indirectly through an image provided by a user. As a pedagogical example, we use the complete image of a Sudoku grid. While ...
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences [0.03%]
具有循环偏好的三维稳定匹配问题的计算松弛方法
Ágnes Cseh,Guillaume Escamocher,Luis Quesada
Ágnes Cseh
Constraint programming has proven to be a successful framework for determining whether a given instance of the three-dimensional stable matching problem with cyclic preferences (3dsm-cyc) admits a solution. If such an instance is satisfiabl...
Georg Gottlob,Cem Okulmus,Reinhard Pichler
Georg Gottlob
Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful decomposition methods have been developed to overcome this complexity. However, this poses the challenge of actually computing such a decomposition for a gi...
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences [0.03%]
一类循环偏好三维稳定匹配问题的约束规划模型集锦
Ágnes Cseh,Guillaume Escamocher,Begüm Genç et al.
Ágnes Cseh et al.
We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed for variants of...
"Almost-stable" matchings in the Hospitals / Residents problem with Couples [0.03%]
医院/居民问题中“几乎稳定”的匹配问题（含伴侣约束）
David F Manlove,Iain McBride,James Trimble
David F Manlove
The Hospitals / Residents problem with Couples (hrc) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is k...
Evaluating the impact of AND/OR search on 0-1 integer linear programming [0.03%]
评估AND/OR搜索在0-1整数线性规划上的影响
R Marinescu,R Dechter
R Marinescu
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-first AND/OR search algorithms to solving 0-1 Integer Linear Pr...