3 papers
cs.AI2025
Faster Symmetry Breaking Constraints for Abstract Structures
Ãzgür Akgün, Mun See Chang, Ian P. Gent +1
In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level mode…
cs.AI2025
TabID: Automatic Identification and Tabulation of Subproblems in Constraint Models
Ãzgür Akgün, Ian P. Gent, Christopher Jefferson +5
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint (referred to as tabulation). Finding subproblems to tabulate i…
cs.AI2025
Athanor: Local Search over Abstract Constraint Specifications
Saad Attieh, Nguyen Dang, Christopher Jefferson +2
Local search is a common method for solving combinatorial optimisation problems. We focus on general-purpose local search solvers that accept as input a constraint model - a declar…