2018
DOI: 10.1016/j.dam.2017.09.005
|View full text |Cite
|
Sign up to set email alerts
|

Constructing day-balanced round-robin tournaments with partitions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Scheduling problems for sports tournaments are a broad and extensively researched field in combinatorics, operations research and combinatorial optimization. A prominent example is the roundrobin tournament problem with applications, e.g., in computer science (see, e.g., [1][2][3][4][5][6][7] to mention just some of the most recent work on the subject). Another one is the traveling tournament problem (see, e.g., [8][9][10]).…”
Section: Description Of the Problemmentioning
confidence: 99%
“…Scheduling problems for sports tournaments are a broad and extensively researched field in combinatorics, operations research and combinatorial optimization. A prominent example is the roundrobin tournament problem with applications, e.g., in computer science (see, e.g., [1][2][3][4][5][6][7] to mention just some of the most recent work on the subject). Another one is the traveling tournament problem (see, e.g., [8][9][10]).…”
Section: Description Of the Problemmentioning
confidence: 99%
“…Geinoz et al (2008) studied some constructions of balanced schedules based on partitions into subleagues. Erzurumluoglu (2018) exploited the idea of partitioning the league for constructing several types of balanced schedules.…”
Section: Venuesmentioning
confidence: 99%
“…The rest of paper will contain related work, research method, discussion and result, and conclusions and future work. [4]. The RR load balancer forwards the client requests to each server one at a time [5].…”
Section: Introductionmentioning
confidence: 99%