Global constraints for round robin tournament scheduling

Henz, Martin; Müller, Tobias; Thiel, Sven

doi:10.1016/s0377-2217(03)00101-2

Cited by 59 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This naïvety was due to the use of the term "round-robin" for these schedules, leading us to believe that we could use some of the models already in the literature [7,6,1]. This naïvety slowly dissolved as we addressed more and more of the ISAF criteria.…”

Section: Flightmentioning

confidence: 99%

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists

Macdonald

McCreesh

Miller

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a constraint programming solution to the problem of generating round-robin schedules for sailing match races. Our schedules satisfy the criteria published by the International Sailing Federation (ISAF) governing body for match race pairing lists. We show that some published ISAF schedules are in fact illegal, and present corresponding legal instances and schedules that have not previously been published. Our schedules can be downloaded as blanks, then populated with actual competitors and used in match racing competitions.

show abstract

Section: Flightmentioning

confidence: 99%

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists

Macdonald

McCreesh

Miller

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…For other values of n, the best known results are by Anderson (1999). Henz, Müller & Thiel (2004) and Miyashiro & Matsui (2006) also tackle this problem, but without improving on the results by Anderson. Recently, Guedes & Ribeiro (2009) presented a weighted variant of the carry-over effects value, taking into account the relative strengths of the teams, and developed a heuristic for the problem to produce a schedule that minimizes this measure.…”

Section: Related Workmentioning

confidence: 99%

The Carryover Effect Does Not Influence Football Results

Goossens

Spieksma

2011

Journal of Sports Economics

View full text Add to dashboard Cite

In a round robin tournament, it is often believed that each team has an effect on its opponent which carries over to the next game of that opponent. Indeed, if team A plays against team B, and subsequently against team C, A's performance against C may have been affected by B, and we say that team C receives a carry-over effect from B. For instance, if team B is a very strong team, then team A could be exhausted and discouraged after this game, which could benefit its next opponent, team C.Clearly, any schedule will lead to carry-over effects. In practice, the perceived influence of carry-over effects has been used as an argument when producing a schedule. In this work, we develop an approach to measure whether carry-over effects have an influence on the outcome of football matches. We apply this method on the highest division in Belgium, using data from over 30 seasons, amounting over 10,000 matches. In our dataset, we find no evidence to support the claim that carry-over effects affect the results, which has major implications for the sporting community with respect to generating fixtures.

show abstract

“…In this paper, it is also shown how the classical alldiff constraint plus some additional constraints can be useful to solve the original problem. The comparison between this approach, the symmetric alldiff constraint, and the alldiff constraint has been carried out by (Henz et al, 2003).…”

Section: (A)mentioning

confidence: 99%

Global Constraints and Filtering Algorithms

Régin¹

2004

Constraint and Integer Programming

View full text Add to dashboard Cite

Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldiff and the global cardinality constraints, are fully detailed. Filtering algorithms are also considered from a theoretical point of view: three different ways to design filtering algorithms are described and the quality of the filtering algorithms studied so far is discussed. A categorization is then proposed. Over-constrained problems are also mentioned and global soft constraints are introduced.

show abstract

Global constraints for round robin tournament scheduling

Cited by 59 publications

References 13 publications

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists

The Carryover Effect Does Not Influence Football Results

Global Constraints and Filtering Algorithms

Contact Info

Product

Resources

About