7 citations · 26 across the 16 of their papers we have counts for
19 papers
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…
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…
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…
Perfect refiners for permutation group backtracking algorithms
Christopher Jefferson, Rebecca Waldecker, Wilf A. Wilson
Backtrack search is a fundamental technique for computing with finite permutation groups, which has been formulated in terms of points, ordered partitions, and graphs. We provide a…
Computing normalisers of intransitive groups
Mun See Chang, Christopher Jefferson, Colva M. Roney-Dougal
The normaliser problem takes as input subgroups and of the symmetric group , and asks one to compute . The fastest known algorithm for this problem is simply e…
Towards Reformulating Essence Specifications for Robustness
Özgür Akgün, Alan M. Frisch, Ian P. Gent +4
The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made. Essence specifications are…