Skip to content

Research at St Andrews

Modelling Langford's Problem: a viewpoint for search

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Close

Details

Original languageEnglish
Title of host publicationThe Seventeenth Workshop on Constraint Modelling and Reformulation (ModRef 2018), Proceedings
Number of pages11
Publication statusPublished - 27 Aug 2018
Event24th International Conference on Principles and Practice of Constraint Programming (CP 2018) - Euratechnologies, Lille, France
Duration: 27 Aug 201831 Aug 2018
Conference number: 24
http://cp2018.a4cp.org/

Conference

Conference24th International Conference on Principles and Practice of Constraint Programming (CP 2018)
Abbreviated titleCP 2018
CountryFrance
CityLille
Period27/08/1831/08/18
Internet address

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining

    Kocak, G., Akgün, Ö., Miguel, I. & Guns, T., 30 Sep 2019, The 18th workshop on Constraint Modelling and Reformulation (ModRef 2019), Proceedings. 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  2. Cloud benchmarking for maximising performance of scientific applications

    Varghese, B., Akgun, O., Miguel, I. J., Thai, L. T. & Barker, A. D., 1 Jan 2019, In : IEEE Transactions on Cloud Computing. 7, 1, p. 170-182 13 p., 7553491.

    Research output: Contribution to journalArticle

  3. Automatic streamlining for constrained optimisation

    Spracklen, P., Dang, N., Akgun, O. & Miguel, I. J., 2019, Principles and Practice of Constraint Programming: 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings. Schiex, T. & de Givry, S. (eds.). Cham: Springer, p. 366-383 (Lecture Notes in Computer Science (Programming and Software Engineering); vol. 11802).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Instance generation via generator instances

    Akgun, O., Dang, N., Miguel, I. J., Salamon, A. Z. & Stone, C. L., 2019, Principles and Practice of Constraint Programming: 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings. Schiex, T. & de Givry, S. (eds.). Cham: Springer, p. 3-19 (Lecture Notes in Computer Science (Programming and Software Engineering); vol. 11802).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. Closed frequent itemset mining with arbitrary side constraints

    Kocak, G., Akgun, O., Miguel, I. J. & Nightingale, P. W., 17 Nov 2018, 2018 IEEE International Conference on Data Mining Workshops (ICDMW). Tong, H., Li, Z. J., Zhu, F. & Yu, J. (eds.). IEEE Computer Society, p. 1224 - 1232 9 p. 8637581

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

ID: 255666280

Top