Please use this identifier to cite or link to this item:
|Title:||Global constraints for round robin tournament scheduling||Authors:||Henz, M.
|Issue Date:||2004||Citation:||Henz, M., Müller, T., Thiel, S. (2004). Global constraints for round robin tournament scheduling. European Journal of Operational Research 153 (1) : 92-101. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-2217(03)00101-2||Abstract:||In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-and-bound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithms during search. In this paper, we analyze arc-consistent propagation algorithms for the global constraints "all-different" and "one-factor" in the domain of round robin tournaments. The best propagation algorithms allow us to compute all feasible perfectly mirrored pattern sets with minimal breaks for intermural tournaments of realistic size, and to improve known lower bounds for intramural tournaments balanced with respect to carry-over effects. © 2003 Published by Elsevier B.V.||Source Title:||European Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/40786||ISSN:||03772217||DOI:||10.1016/S0377-2217(03)00101-2|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 16, 2019
WEB OF SCIENCETM
checked on Oct 9, 2019
checked on Oct 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.