Abstract
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.
Original language | English |
---|---|
Title of host publication | The Seventeenth Workshop on Constraint Modelling and Reformulation (ModRef 2018), Proceedings |
Number of pages | 11 |
Publication status | Published - 27 Aug 2018 |
Event | 24th International Conference on Principles and Practice of Constraint Programming (CP 2018) - Euratechnologies, Lille, France Duration: 27 Aug 2018 → 31 Aug 2018 Conference number: 24 http://cp2018.a4cp.org/ |
Conference
Conference | 24th International Conference on Principles and Practice of Constraint Programming (CP 2018) |
---|---|
Abbreviated title | CP 2018 |
Country/Territory | France |
City | Lille |
Period | 27/08/18 → 31/08/18 |
Internet address |
Fingerprint
Dive into the research topics of 'Modelling Langford's Problem: a viewpoint for search'. Together they form a unique fingerprint.Datasets
-
Modelling Langford's Problema viewpoint for search: (dataset)
Akgun, O. (Creator) & Miguel, I. J. (Creator), GitHub, 11 Jul 2018
https://github.com/stacs-cp/ModRef2018-Langfords
Dataset