Modelling Langford's Problem : a viewpoint for search
MetadataShow full item record
Altmetrics Handle Statistics
The performance of enumerating all solutions to an instance of Langford's Problem is sensitive to the model and the search strategy. In this paper we compare the performance of a large variety of models, all derived from two base viewpoints. We empirically show that a channelled model with a static branching order on one of the viewpoints offers the best performance out of all the options we consider. Surprisingly, one of the base models proves very effective for propagation, while the other provides an effective means of stating a static search order.
Akgün , Ö & Miguel , I 2018 , Modelling Langford's Problem : a viewpoint for search . in The Seventeenth Workshop on Constraint Modelling and Reformulation (ModRef 2018), Proceedings . 24th International Conference on Principles and Practice of Constraint Programming (CP 2018) , Lille , France , 27/08/18 .conference
The Seventeenth Workshop on Constraint Modelling and Reformulation (ModRef 2018), Proceedings
Copyright the Authors 2018.
DescriptionFunding: EPSRC (EP/P015638/1).
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.