Abstract
Sports scheduling is a classical problem in the field of combinatorial optimization. One of the first successful methods to solve a complex instance was implemented using constraint programming. In this article, we explore an alternate and lighter way of modeling the round-robin part of the problem. We show this model can be enriched by additional propagations that complement the all different constraint. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Perron, L. (2005). Alternate modeling in sport scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 797–801). https://doi.org/10.1007/11564751_67
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
