Abstract
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T ≤ 40. The proposed approach relies on interesting properties which are used to constraint the search process. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Hamiez, J. P., & Hao, J. K. (2006). Sports league scheduling: Enumerative search for Prob026 from CSPLib. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4204 LNCS, pp. 716–720). Springer Verlag. https://doi.org/10.1007/11889205_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
