Show simple item record

Files in this item


Item metadata

dc.contributor.authorAkgün, Özgür
dc.contributor.authorMiguel, Ian
dc.identifier.citationAkgü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 .en
dc.identifier.otherPURE: 255666280
dc.identifier.otherPURE UUID: 56bd918c-ab3c-4a66-b6fa-e5b71f88b1b6
dc.identifier.otherORCID: /0000-0001-9519-938X/work/48131986
dc.identifier.otherORCID: /0000-0002-6930-2686/work/68281456
dc.descriptionFunding: EPSRC (EP/P015638/1).en
dc.description.abstractThe 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.
dc.relation.ispartofThe Seventeenth Workshop on Constraint Modelling and Reformulation (ModRef 2018), Proceedingsen
dc.rightsCopyright the Authors 2018.en
dc.subjectQA75 Electronic computers. Computer scienceen
dc.titleModelling Langford's Problem : a viewpoint for searchen
dc.typeConference itemen
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews.Centre for Interdisciplinary Research in Computational Algebraen

This item appears in the following Collection(s)

Show simple item record